2011/08/25 by Byung Gyun Kang, Kang, Byung Gyun, Hyun Kwang Kim +3
Engineering · Computer Science · Mathematics · #graph theory and CDMA systems #Coding theory and cryptography #Finite Group Theory Research
paper · pdf · doi:10.48550/arxiv.1108.5104
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 bounds on A(n,d,w) for n ≤ 28. The used techniques allow us to give a simple proof of an important theorem of Delsarte which makes linear programming possible for binary codes.