@comment{ generated by <http://infoscience.epfl.ch/> }

@InProceedings{Maneva2006/ALGO,
   abstract    = {We 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
                 bit-error probability as the length of the code goes to
                 infinity via recent results in random hypergraphs by
                 Darling and Norris, Ann. Appl. Probab., 2005. For a code
                 of finite length, we provide an algorithm for computing
                 the probability of block-error of the decoder. This
                 algorithm improves by a linear factor the algorithm of
                 Karp, Luby, and Shokrollahi, Proc. of ISIT, 2004.},
   address     = { },
   affiliation = {EPFL},
   author      = {Maneva, E. and Shokrollahi, A.},
   booktitle   = {Proceedings of the {IEEE} {I}nternational {S}ymposium on
                 {I}nformation {T}heory, {ISIT} 2006},
   details     = {http://infoscience.epfl.ch/record/99175},
   doi         = {10.1109/ISIT.2006.262139},
   keywords    = {Fountain Codes; LT Codes; Graph based Codes;
                 Probability; algoweb_fountain},
   location    = { },
   oai-id      = {oai:infoscience.epfl.ch:99175},
   oai-set     = {conf},
   pages       = {2677--2679},
   publisher   = { },
   review      = {REVIEWED},
   series      = { },
   status      = {PUBLISHED},
   title       = {New model for rigorous analysis of {LT}-codes},
   unit        = {ALGO},
   url         = { },
   year        = 2006
}