New model for rigorous analysis of LT-codes

Simple item page
dc.creatorManeva, Elitza N.
dc.creatorShokrollahi, Amin
dc.date2005-12-08
dc.date.accessioned2026-07-07T08:15:48Z
dc.date.available2026-07-07T08:15:48Z
dc.descriptionWe present a new model for LT codes which simplifies the analysis of the error probability of decoding by belief propagation. For any given degree distribution, we provide the first rigorous expression for the limiting error probability as the length of the code goes to infinity via recent results in random hypergraphs [Darling-Norris 2005]. For a code of finite length, we provide an algorithm for computing the probability of error of the decoder. This algorithm improves the one of [Karp-Luby-Shokrollahi 2004] by a linear factor.
dc.identifierhttps://arxiv.org/abs/cs/0512029
dc.identifierhttp://arxiv.org/abs/cs/0512029
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133568
dc.subjectInformation Theory
dc.titleNew model for rigorous analysis of LT-codes
dc.typetext

Files

Collections

arXiv