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. https://resolver.caltech.edu/CaltechAUTHORS:FREieeetit01
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 51Kb |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:FREieeetit01
Abstract
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. |
| Issue or Number: | 2 |
| Record Number: | CaltechAUTHORS:FREieeetit01 |
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:FREieeetit01 |
| Alternative URL: | http://dx.doi.org/10.1109/TIT.2001.910571 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 3381 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Archive Administrator |
| Deposited On: | 02 Jun 2006 |
| Last Modified: | 02 Oct 2019 23:02 |
Repository Staff Only: item control page
