Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
arXiv:0807.2680 · doi:10.1109/TIT.2008.926349
Abstract
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.
13 pages, 1 figure, 4 tables
References in corpus (1)
Cited by in corpus (8)
- Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
- Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
- A Pair of Disjoint 3-GDDs of type g^t u^1
- Linear Size Constant-Composition Codes Meeting the Johnson Bound
- Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six
- Estimates on the Size of Symbol Weight Codes
- Optimal Ternary Constant-Composition Codes with Weight Four and Distance Six
- A construction of group divisible designs with zero block sum