常复合码的PBD-闭包
The PBD-Closure of Constant-Composition Codes
摘要：
我们展示了一个有趣的PBD-封闭的结果的长度的常数组成代码的距离和大小满足一定的条件。这个PBD封闭的结果的一个后果是，最佳的常数组成代码的大小可以确定为参数集的无限家庭从一个单一的例子的最佳代码。作为应用，导出了几个最优常复合码无限族的规模。特别地，确定具有距离4和权重3的最优恒定组成码的大小的问题对于足够大的所有长度都被解决。这个问题以前没有解决奇数长度，除了长度7和11。
英文摘要：
We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the size of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
