Introduction to the special issue on codes on graphs and iterative algorithms
Brendan J. Frey, R. Koetter, G. David Forney, Frank R. Kschischang, Robert J. McEliece, Daniel A. Spielman · IEEE Transactions on Information Theory · 2001
In the 50 years since Shannon determined the capacity of ergodic channels, the construction of capacity-approaching coding schemes has been the supreme goal of coding research. Finally today, we know of practical codes and decoding algorithms that can closely approach the channel capacity of some classical memoryless channels. It is a remarkable fact motivating this special issue that all known practical, capacity-approaching coding schemes are now understood to be codes defined on graphs, together with the associated iterative decoding algorithms.