Abstract
Let A(n,d) (respectively A(n,d,w)) be the maximum possible number of codewords in a binary code (respectively, binary constant-weight w code) of length n and minimum Hamming distance at least d. By adding new linear constraints to Schrijver's semidefinite programming bound, which is obtained from block-diagonalizing the Terwilliger algebra of the Hamming cube, we obtain two new upper bounds on A(n,d), namely A(18,8) ≤ 71 and A(19,8) ≤ 131. Twenty three new upper bounds on A(n,d,w) for n ≤ 28 are also obtained by a similar way.
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 callDisclaimer: 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.
