Abstract
To partially compensate the inefficiency of random codes, we can use Reed–Solomon codes, these codes can be decoded from a block with the maximum possible number of erasures in time quadratic in the dimension. But in practice, these algorithms are often too complicated and quadratic running times are still too large for many applications. Hence, a new class of codes is needed to construct robust and reliable transmission schemes and such a class of codes is known as fountain codes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Luby, M.: LT codes. In: Proceeding of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 271–282 (2002)
Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theor. 52(6), 2551–2567 (2006)
Richardson, T.J., Urbanke, R.L.: The capacity of low density parity check codes under message-passing decoding. IEEE Trans. Inf. Theor. 47(2), 599–618 (2001)
Nguyen, T.D., Yang, L.-L., Hanzo, L.: Systematic luby transform codes and their soft decoding. In: IEEE SiPS’07, pp. 67–72. Shanghai, 17–19 Oct 2007
Gallager, R.: Low density parity check codes. IRE Trans. Inf. Theor. 8(1), 21–28 (1962)
Author information
Authors and Affiliations
Corresponding author
9.1 Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
Copyright information
© 2015 Springer India
About this chapter
Cite this chapter
Deergha Rao, K. (2015). LT and Raptor Codes. In: Channel Coding Techniques for Wireless Communications. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2292-7_9
Download citation
DOI: https://doi.org/10.1007/978-81-322-2292-7_9
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2291-0
Online ISBN: 978-81-322-2292-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)