Linear Size Constant-Composition Codes Meeting the Johnson Bound

DOI10.1109/TIT.2017.2689026zbMATH Open1390.94872arXiv1512.07719OpenAlexW2963192134MaRDI QIDQ4566673FDOQ4566673

Authors: Yeow Meng Chee, Xian De Zhang 

Publication date: 27 June 2018

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

Abstract: The Johnson-type upper bound on the maximum size of a code of length $n$, distance $d=2w-1$ and constant composition $overlinew$ is $lfloordfracn{w}_{1}floor$, where $w$ is the total weight and $w_1$ is the largest component of $overlinew$. Recently, Chee et al. proved that this upper bound can be achieved for all constant-composition codes of sufficiently large lengths. Let $N_{ccc}(overlinew)$ be the smallest such length. The determination of $N_{ccc}(overlinew)$ is trivial for binary codes. This paper provides a lower bound on $N_{ccc}(overlinew)$, which is shown to be tight for all ternary and quaternary codes by giving new combinatorial constructions. Consequently, by refining method, we determine the values of $N_{ccc}(overlinew)$ for all $q$-ary constant-composition codes provided that $3w_{1}geqw$ with finite possible exceptions.

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (2)

• Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
• Approximate generalized Steiner systems and near-optimal constant weight codes

This page was built for publication: Linear Size Constant-Composition Codes Meeting the Johnson Bound

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