Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 1, 2001 | public
Journal Article Open

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

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.

Additional Information

© Copyright 2001 IEEE. Reprinted with permission.

Files

FREieeetit01.pdf
Files (52.7 kB)
Name Size Download all
md5:a004e8744b824a68ff9b3e354a92b45d
52.7 kB Preview Download

Additional details

Created:
August 21, 2023
Modified:
October 16, 2023