On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

Provided by: Scientific Research
Topic: Software
Format: PDF
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper, the authors propose two approaches to attack the hardness of this problem. In that the first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms.

Find By Topic