Iterative Decoding of Low-Density Parity Check Codes (A Survey)
From MaRDI portal
Publication:3396594
zbMATH Open1169.94351arXivcs/0610022MaRDI QIDQ3396594FDOQ3396594
Authors: Venkatesan Guruswami 
Publication date: 19 September 2009
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).
Full work available at URL: https://arxiv.org/abs/cs/0610022
Cited In (1)
This page was built for publication: Iterative Decoding of Low-Density Parity Check Codes (A Survey)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396594)
