
arXiv: 0807.2680
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
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Information Theory, Information Theory (cs.IT), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), :Science::Mathematics::Discrete mathematics::Combinatorics [DRNTU], Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Information Theory, Information Theory (cs.IT), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), :Science::Mathematics::Discrete mathematics::Combinatorics [DRNTU], Computer Science - Discrete Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 19 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
