Fifty-five new or improved lower bounds for \(A(n, d, w)\), the maximum possible number of binary vectors of length \(n\), weight \(w\), and pairwise Hamming distance no less than \(d\), are presented.
Citation
D.G. Knight. Some Lower Bounds for Constant Weight Codes[J], Ars Combinatoria, Volume 093. 165-168. .