New lower bounds for constant weight codes
C.L.M. van Pul, Tuvi Etzion · IEEE Transactions on Information Theory · 1989
Some new lower bounds are given for A(n,4,w), the maximum number of codewords in a binary code of length n, minimum distance 4, and constant weight w. In a number of cases the results significantly improve on the best bounds previously known.>