Year: 2014
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Hengjia, Wei, Hui, Zhang, Mingzhi, Zhu, Gennian, Ge
Institutions: Zhejiang University, Capital Normal University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: 通信理论中若干组合编码问题研究, G4784834569, G8454121759
OpenAlex ID: W2952640993