Using simulated annealing to design good codes
Abbas El Gamal, Lane A. Hemachandra, I. Shperling, Victor K. Wei · IEEE Transactions on Information Theory · 1987
Simulated annealing is a computational heuristic for obtaining approximate solutions to combinatorial optimization problems. It is used to construct good source codes, error-correcting codes, and spherical codes. For certain sets of parameters codes that are better than any other known in the literature are found.