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

Simple item page
dc.creatorGuruswami, Venkatesan
dc.date2006-10-05
dc.date.accessioned2026-07-07T08:18:03Z
dc.date.available2026-07-07T08:18:03Z
dc.descriptionMuch 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).
dc.description29 pages
dc.identifierhttps://arxiv.org/abs/cs/0610022
dc.identifierhttp://arxiv.org/abs/cs/0610022
dc.identifierBulletin of the EATCS, Issue 90, October 2006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134298
dc.subjectInformation Theory
dc.subjectComputational Complexity
dc.subjectE.4
dc.titleIterative Decoding of Low-Density Parity Check Codes (A Survey)
dc.typetext

Files

Collections

arXiv