LT and Raptor Codes
Part of the Forum for Interdisciplinary Mathematics book series (FFIM)
To partially compensate for the inefficiency of random codes, we can use Reed–Solomon codes, and these codes can be decoded from a block with the maximum possible number of erasures in time quadratic in the dimension.
- 1.M. Luby, LT codes, in Proceeding of the 43rd Annual IEEE Symposium on Foundations of Computer Science, November 2002, pp. 271–282Google Scholar
- 4.T.D. Nguyen, L.-L. Yang, L. Hanzo, Systematic Luby transform codes and their soft decoding, in IEEE SiPS’07, Shanghai, China, 17–19 October 2007, pp. 67–72Google Scholar
© Springer Nature Singapore Pte Ltd. 2019