ABSTRACT
Genetic algorithms have been used successfully for solving different combinatorial optimization problems. We give here a new efficient application for the search of constant weight codes. The algorithm presented is intended to generate codes with the maximum number of codewords for a given length, constant weight and minimum Hamming distance. A comparison with the simulated annealing technique is also discussed. On the other hand, the algorithm introduces a new scaling for the cost function that proved to be more effective than other scalings used in the literature.
