New lower bounds for constant weight codes

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