Title :
Combinatorial constructions of optimal constant-composition codes
Author :
Ding, Cunsheng ; Yin, Jianxing
Author_Institution :
Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., China
Abstract :
Constant-composition codes (CCCs) are a special class of constant-weight codes. They include permutation codes as a subclass. In this correspondence, a link between CCCs and generalized double resolvable packing designs is developed, and used to construct several infinite series of optimal CCCs.
Keywords :
block codes; combinatorial mathematics; group codes; optimisation; series (mathematics); CCC; combinatorial construction; constant-weight code; generalized double resolvable packing design; infinite series; optimal constant-composition code; permutation code; Code standards; Cryptography; Galois fields; Hamming distance; Hamming weight; Notice of Violation; Constant-composition codes (CCCs); constant-weight codes; generalized double resolvable packing designs;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2005.855612
