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

From MaRDI portal
Publication:3604754

DOI10.1109/TIT.2008.926349zbMATH Open1181.94123arXiv0807.2680OpenAlexW2127086879MaRDI QIDQ3604754FDOQ3604754


Authors: Yeow Meng Chee, Gennian Ge, Alan C. H. Ling Edit this on Wikidata


Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0807.2680




Recommendations





Cited In (13)





This page was built for publication: Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604754)