On the size of maximal binary codes with 2, 3, and 4 distances
arXiv:2210.07496 · doi:10.5070/C64163844
Abstract
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 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.
arXiv commentMain text 23 pp. and Appendix 17pp
References in corpus (5)
- Bounds on sets with few distances
- Semidefinite programming bounds for constant weight codes
- Spherical two-distance sets and eigenvalues of signed graphs
- Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erdős and Sós
- Semidefinite Programming Bounds For Spherical Three-distance Sets