Using the genetic algorithm to find snake-in-the-box codes
IEA/AIE '94 Proceedings of the 7th international conference on Industrial and engineering applications of artificial intelligence and expert systems
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The coil-in-the-box problem is a variation of a difficult problem in mathematics and computer science, known as the snake-in-the-box problem, that was first described by Kautz in the late 1950's [7]. Coil-in-the-box codes have many applications in electrical engineering, coding theory, and computer network topologies. Generally, the longer the coil for a given dimension, the more useful it is in these applications [9]. By applying a relatively recent evolutionary search algorithm known as a population-based stochastic hill-climber, new lower bounds were achieved for the longest-known coil in each of the dimensions nine through eleven.