A Comparative Study of Search Techniques Applied to the Minimum Distance Problem of Bch Codes

Abstract

BCH codes have been shown to be excellent errorcorrecting codes among codes of short lengths. The errorcorrecting 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.

2 Figures and Tables

Cite this paper

@inproceedings{Wallis2002ACS, title={A Comparative Study of Search Techniques Applied to the Minimum Distance Problem of Bch Codes}, author={Joanna L. Wallis and Sheridan K. Houghten}, year={2002} }