Computer Science – Information Theory
Scientific paper
2008-07-17
IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3552-3564, 2008
Computer Science
Information Theory
13 pages, 1 figure, 4 tables
Scientific paper
10.1109/TIT.2008.926349
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and constant-composition codes. Large classes of group divisible codes are constructed which enabled the determination of the sizes of optimal constant-composition codes of weight three (and specified distance), leaving only four cases undetermined. Previously, the sizes of constant-composition codes of weight three were known only for those of sufficiently large length.
Chee Yeow Meng
Ge Gennian
Ling Alan C. H.
No associations
LandOfFree
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-41877