Abstract
Any subset C of the group $${\mathbb {Z}}_2^n$$ is called a binary code of length n and its elements are called codewords. Let A(n, d) be the maximum size of a binary code of length n in which the Hamming distance of any two codewords is at least d. In this paper, using the Delsarte–Hoffman bound and some tools from algebraic graph theory, we provide new upper bounds on A(n, d).
Sign-in/Register to access full text options 
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 callMore From: Iranian Journal of Science and Technology, Transactions A: Science
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.
