Raptor codes
Amin Shokrollahi · IEEE Transactions on Information Theory · 2006
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper, we introduce Raptor codes, an extension of LT-codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: for a given integer k and any real epsiv>0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1+epsiv) is sufficient to recover the original k symbols with high probability. Each output symbol is generated using O(log(1/epsiv)) operations, and the original symbols are recovered from the collected ones with O(klog(1/epsiv)) operations. We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions in which the first output elements of the coding system coincide with the original k elements
Cited by 2,154 works. doi:10.1109/tit.2006.874390
Authors
References
- Low-Density Parity-Check Codes
- LT codes
- Efficient erasure correcting codes
- Analysis of random processes via And-Or tree evaluation
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- Improved low-density parity-check codes using irregular graphs
- A digital fountain approach to reliable distribution of bulk data
- New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity
- Capacity-achieving sequences for the erasure channel
- Finite length analysis of LT codes