USING SIMULATED ANNEALING TO DESIGN GOOD CODES.

被引：106

作者：

El Gamal, Abbas A. ^{[1
]}

Hemachandra, Lane A. ^{[1
]}

Shperling, Itzhak ^{[1
]}

Wei, Victor K. ^{[1
]}

机构：

[1] Stanford Univ, CA, USA, Stanford Univ, CA, USA

来源：

IEEE Transactions on Information Theory | 1987年 / IT-33卷 / 01期

关键词：

COMPUTER PROGRAMMING - Algorithms - INFORMATION THEORY - MATHEMATICAL TECHNIQUES - Heuristic - OPTIMIZATION;

D O I：

10.1109/TIT.1987.1057277

中图分类号：

学科分类号：

摘要：

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 to the authors are found. Results using computer experiments are presented to explain the usefulness of the algorithm.

引用

页码：116 / 123