Channel coding: The road to channel capacity

By J. F. I. Daniel J. Costello, J. G. D. G. David Forney. Proceedings of the IEEE, 2006

422 citations recorded by the source corpus.

Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to capacity-approaching codes. We focus on the contributions that have led to the most significant improvements in performance versus complexity for practical applications, particularly on the additive white Gaussian noise channel. We discuss algebraic block codes, and why they did not prove to be the way to get to the Shannon limit. We trace the antecedents of today's capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes. Finally, we sketch some of the practical applications of these codes.

Subfields: Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/7a06e3b183842dc53378acd250918eb97e52f77c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Polar Codes for Channel and Source Coding (2009, methodology): “For a detailed history of channel coding we refer the interested reader to the excellent article by Costello and Forney [8].”
Spatially coupled ensembles universally achieve capacity under belief propagation (2012, background): “The interested reader can find an excellent historical review in [4].”