Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three

Simple item page
dc.creatorChee, Yeow Meng
dc.creatorGe, Gennian
dc.creatorLing, Alan C. H.
dc.date2008-07-17
dc.date.accessioned2026-07-07T09:50:55Z
dc.date.available2026-07-07T09:50:55Z
dc.descriptionThe 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.
dc.description13 pages, 1 figure, 4 tables
dc.identifierhttps://arxiv.org/abs/0807.2680
dc.identifierhttp://arxiv.org/abs/0807.2680
dc.identifierIEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3552-3564, 2008
dc.identifierdoi:10.1109/TIT.2008.926349
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165111
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleGroup Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
dc.typetext

Files

Collections

arXiv