pith. sign in

arxiv: cs/0610022 · v1 · submitted 2006-10-05 · 💻 cs.IT · cs.CC· math.IT

Iterative Decoding of Low-Density Parity Check Codes (A Survey)

classification 💻 cs.IT cs.CCmath.IT
keywords algorithmscodescheckdecodingiterativelow-densityparityarticle
0
0 comments X
read the original abstract

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely efficient (both in theory and practice).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.