重量为4、距离为5或6的四元常复合码
Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six
摘要：
Chee，Ge和Ling在四种情况下确定了重量为3的最优常复合码的码长。群可分码在它们的构造中起着重要的作用。本文研究了利用群可分码和Room Square方法构造Hamming重量为4、最小距离为5或6的最优四元常复合码的问题。问题解决了，只剩下五个长度未确定。以前，这样的四元常数组成码的大小的结果是稀缺的。
英文摘要：
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 quaternary constant-composition codes with Hamming weight four and minimum distances five or six through group divisible codes and Room square approaches. The problem is solved leaving only five lengths undetermined. Previously, the results on the sizes of such quaternary constant-composition codes were scarce.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
