Iterative Decoding of Low-Density Parity Check Codes (A Survey)
Venkatesan Guruswami
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).
Create a lesson
Related papers
An Approach to Asynchronous Unsourced Random Access
Alireza Karami, Dmitry Trukhachev
Local Private Information Retrieval for Graph-Based Replicated Systems
Shreya Meel, Mohamed Nomeir, Sennur Ulukus
Semantic Freshness Optimal Sampling and Transmission for Gossiping Receivers
Irtiza Hasan, Ahmed Arafa
Minimax bounds for watermarked and masked recursive discrete distribution estimation
Millen Kanabar, Michael Gastpar
Fast Fault-Tolerant Decoders for Hypergraph Product and Lifted-Product Codes
Asit Kumar Pradhan, Nithin Raveendran, David Declercq et al.
Asymptotic Bounds on Generalized Covering Radii of Binary Primitive BCH Codes
Maosheng Xiong, Chi Hoi Yip, Ferdinando Zullo