Genetic algorithm for computing the minimum distance of linear block codes
Xin Wang · Jounal of Xidian University · 1999
A new method based on Genetic Algorithm is presented to compute the minimum distance of linear block codes, which is a stochastic parallel optimization algorithm for simulating natural genetics and Darwinian evolution. This method can easily be implemented on parallel computer architectures and used to find the global optimal solution of the objective function. Computer simulations are given to indicate that Genetic Algorithm is very powerful in providing good upper bounds to the minimum distance of general linear block codes.