Some Lower Bounds for Constant Weight Codes

D.G. Knight1
1Division of Mathematics and Statistics University of Glamorgan, Pontypridd, CF37 IDL, Wales, U.K.

Abstract

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.