A Caltech Library Service

Introduction to the special issue on codes on graphs and iterative algorithms

Frey, Brendan J. and Koetter, Ralf and Forney, G. David, Jr. and Kschischang, Frank R. and Spielman, Daniel A. (2001) Introduction to the special issue on codes on graphs and iterative algorithms. IEEE Transactions on Information Theory, 47 (2). pp. 493-497. ISSN 0018-9448.

See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Article
Additional Information:© Copyright 2001 IEEE. Reprinted with permission.
Record Number:CaltechAUTHORS:FREieeetit01
Persistent URL:
Alternative URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:3381
Deposited By: Archive Administrator
Deposited On:02 Jun 2006
Last Modified:26 Dec 2012 08:54

Repository Staff Only: item control page