Comparative Study of Search Techniques Applied to the Minimum Distance Problem of BCH Codes [PDF]
J.L. Wallis and S.K. Houghten, May 2002.
BCH codes have been shown to be excellent error-correcting codes among codes of short lengths. The error-correcting capability of a code is directly related to its minimum distance. It is computationally very difficult to determine the true minimum distance of BCH codes. We analyze and compare the behaviour of different heuristic search techniques when applied to the problem of finding the true minimum weight of BCH codes. A basic genetic algorithm significantly outperformed hill-climbing, tabu search and hybrid techniques.