The reviewed record of science sign in
Pith

arxiv: 1409.6092 · v2 · pith:56CWANP7 · submitted 2014-09-22 · cs.IT · math.CO· math.IT

Optimal Ternary Constant-Composition Codes with Weight Four and Distance Six

Wei Hengjia , Zhang Hui , Zhu Mingzhi , Ge Gennian This is my paper

Reviewed by Pithpith:56CWANP7open to challenge →

classification cs.IT math.COmath.IT
keywords codesconstant-compositionfouroptimalweightdistanceproblemternary
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.