Author :
Shokrollahi, Amin
Author_Institution :
Ecole Polytech. Fed. de Lausanne, Switzerland
fDate :
27 June-2 July 2004
Abstract :
This paper exhibits a class of universal Raptor codes: for a given integer k, and any real ε>0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + ε) is sufficient to recover the original k symbols, with high probability. Each output symbol is generated using O(log(1/ε)) operations, and the original symbols are recovered from the collected ones with O(klog(1/ε)) operations.
Keywords :
Hamming codes; error statistics; linear codes; probability; belief propagation decoding algorithm; infinite symbol stream; linear time codes; probability distribution; universal Raptor codes; Algorithm design and analysis; Application software; Arithmetic; Belief propagation; Computer networks; Decoding; Encoding; Hamming weight; Probability distribution; Sampling methods;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365073
