Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

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

Wei Hengjia , Zhang Hui , Zhu Mingzhi , Ge Gennian This is my paper
classification cs.IT math.COmath.IT
keywords codesconstant-compositionfouroptimalweightdistanceproblemternary
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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.

discussion (0)

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