Improved Semidefinite Programming Bound on Sizes of Codes

Hyun Kwang Kim, Phan Thanh Toan

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…