论文标题
部分可观测时空混沌系统的无模型预测
On the size of maximal binary codes with 2, 3, and 4 distances
论文作者
论文摘要
我们解决了二进制代码和二进制恒定重量代码的最大尺寸，距离很少。以前的工作为这些数量建立了许多界限，以及一系列小型代码长度的确切值。作为我们的主要结果，我们确定了所有长度为$ n \ ge 6 $的最大二进制代码的确切大小，以及最大二进制恒定重量代码的确切大小，具有2,3的最大二进制恒定重量代码，而重量的几个值和除小长度外的几个值。
We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main results, we determine the exact size of maximal binary codes with two distances for all lengths $n\ge 6$ as well as the exact size of maximal binary constant weight codes with 2,3, and 4 distances for several values of the weight and for all but small lengths.
