Simulated annealing approach to the minimum distance of error-correcting codes
ZHANG MUXIANG, Fulong Ma · International Journal of Electronics · 1994
Simulated annealing is a Monte Carlo method for obtaining approximate solutions to combinatorial optimization problems. It is used to compute the minimum distance of linear block codes in this paper. Computer simulations indicate that simulated annealing is useful in providing good upper bounds to the minimum distance of general linear block codes.