Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Wave and equation based rate control using multicast round trip time
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Solving Large Sparse Linear Systems over Finite Fields
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This monograph describes the theory behind Raptor codes, and elucidates elements of the processes behind the design of two of the most prominent members of this class of codes: R10 and RaptorQ (RQ). R10 has already been adopted by a number of standards' bodies, and RQ is in the process of entering various standards at the time of writing of this monograph. The monograph starts with the description of some of the transmission problems, which inspired the invention of Fountain codes. Thereafter, Luby transform codes (LT codes) and Raptor codes are introduced and insights are provided into their design. These codes are currently the most efficient realizations of Fountain codes. Different algorithms are introduced for encoding and decoding various versions of these codes, including their systematic versions. Moreover, a hybrid decoding algorithm called "inactivation decoding" is introduced, which is an integral part of all modern implementations of Raptor codes. The R10 and RQ codes have been continued and will continue to be adopted into a number of standards and thus there are publicly available specifications that describe exactly how to implement these codes. However, the standards' specifications provide no insight into the rationale for the design choices made. One of the primary purposes of this document is to provide this design rationale. We provide results of extensive simulations of R10 and RQ codes to show the behavior of these codes in many different scenarios.