---

Using Genetic Algorithms to Design Constant Weight Codes.

F.Comellas , R. Roca

Departament de Matemàtica Aplicada i Telemàtica; Universitat Politècnica de Catalunya

---

pp. 119-124 of the Proceedings of the International Workshop on Applications of Neural Networks to Telecommunications; Edited by: J. Alspector, R. Goodman, T.X. Brown. Lawrence Erlbaum Associates, Publishers. Hillsdale, New Jersey, 1993. ISBN 0-8058-1560-0

---

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.

---

Load:

• pdf (120K)
• new binary constant weight codes 1992
• PFC -equiv. to a Master Thesis - from R. Roca in which this paper is based (in Catalan)
• C program used to obtain all new binary constant weight codes
• new binary constant weight codes 2015

---