Some lower bounds for constant weight codes

Abstract Let A(n, d, w) denote the maximum number of codewords in any binary constant weight code of length n , minimum distance d and constant weight w . In this note we mention some improvements to the lower bounds for A(n, d, w), d ≤ 10 , given in [2] and [4]. We also mention several lower bounds for A(n, 12, w) .