Optimal Ternary Constant-Composition Codes with Weight Four and Distance Six
Information Theory
2014-10-03 v2 Combinatorics
math.IT
Abstract
The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of lengths undetermined. The previously known results are those with code length no greater than 10.
Cite
@article{arxiv.1409.6092,
title = {Optimal Ternary Constant-Composition Codes with Weight Four and Distance Six},
author = {Wei Hengjia and Zhang Hui and Zhu Mingzhi and Ge Gennian},
journal= {arXiv preprint arXiv:1409.6092},
year = {2014}
}
Comments
44 pages