Linear Size Constant-Composition Codes Meeting the Johnson Bound

The Johnson-type upper bound on the maximum size of a code of length n , distance d=2w-1 , and constant composition {\overline {w}} is \lfloor \dfrac {\vphantom {R^{.}}n}{w_{1}}\rfloor , where w is the total weight and w_{1} is the largest component of {\overline {w}} . Recently, Chee et a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2018-02, Vol.64 (2), p.909-917
Main Authors: Chee, Yeow Meng, Zhang, Xiande
Format: Article
Language:English
Subjects:
balanced packings
Binary codes
Binary system
Codes
Combinatorial analysis
Composition
Constant-composition codes
difference families
Frequency modulation
Indexes
Johnson-type bound
Lower bounds
Memoryless systems
Nickel
Upper bound
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Johnson-type upper bound on the maximum size of a code of length n , distance d=2w-1 , and constant composition {\overline {w}} is \lfloor \dfrac {\vphantom {R^{.}}n}{w_{1}}\rfloor , where w is the total weight and w_{1} is the largest component of {\overline {w}} . Recently, Chee et al. proved that this upper bound can be achieved for all constant-composition codes of sufficiently large lengths. Let N_{ccc}({\overline {w}}) be the smallest such length. The determination of N_{ccc}({\overline {w}}) is trivial for binary codes. This paper provides a lower bound on N_{ccc}({\overline {w}}) , which is shown to be tight for all ternary and quaternary codes by giving new combinatorial constructions. Consequently, by the refining method, we determine the values of N_{ccc}({\overline {w}}) , for all q -ary constant-composition codes, provided that 3w_{1}\geq w with finite possible exceptions.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2017.2689026