The PBD-Closure of Constant-Composition Codes

Simple item page
dc.creatorChee, Yeow Meng
dc.creatorLing, Alan C. H.
dc.creatorLing, San
dc.creatorShen, Hao
dc.date2007-12-16
dc.date.accessioned2026-07-07T08:49:33Z
dc.date.available2026-07-07T08:49:33Z
dc.descriptionWe show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the size of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0712.2552
dc.identifierhttp://arxiv.org/abs/0712.2552
dc.identifierIEEE Transactions on Information Theory, vol. 53, No. 8, August 2007, pp. 2685-2692
dc.identifierdoi:10.1109/TIT.2007.901175
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144337
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleThe PBD-Closure of Constant-Composition Codes
dc.typetext

Files

Collections

arXiv