New Bounds on the Size of Binary Codes With Large Minimum Distance

• Published in: IEEE journal on selected areas in information theory Vol. 4; pp. 219 - 231
• Main Authors: Pang, James Chin-Jen, Mahdavifar, Hessam, Pradhan, S. Sandeep
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Binary codes; Codes; Eigenvalues and eigenfunctions; Error correction codes; Hamming distances; Harmonic analysis; Information theory; Lower bounds; Polynomials; Reed-Muller codes; Upper bound; Upper bounds

Let <inline-formula> <tex-math notation="LaTeX">A(n, d) </tex-math></inline-formula> denote the maximum size of a binary code of length <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> and minimum Hamming d...