Abstract

We prove a new bound on the size of codes with few distances in the Hamming space, improving an earlier result of P. Delsarte. We also improve the Ray-Chaudhuri-Wilson bound of the size of uniform intersecting families of subsets (constant-weight codes) and the bound of Delsarte-Goethals-Seidel on the maximum size of spherical codes with few distances. Finally, we find the size of maximal binary codes and maximal constant-weight codes of small length with 2,3, and 4 distances.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.