Abstract :
A(n,d, w) denotes the maximum cardinality of any binary code of length n, minimum distance d, and constant weight w. The results of a search for good constant weight codes using a combinatorial optimization algorithm are reported. A brief description of the algorithm is given. The problem of constructing a constant weight code of length n, minimum distance d, and weight w containing M codewords is mapped to an optimization problem. The algorithm is used to solve the optimization problem for given parameters n, d,w, and M. The application of the algorithm has led to some new constant weight codes. Their parameters are given
