Improved Linear Programming Bounds on Sizes of Constant-Weight Codes

Byung Gyun Kang, Hyun Kwang Kim, Phan Thanh Toan

Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper…