Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Luby, LT codes, in Proceeding of the 43rd Annual IEEE Symposium on Foundations of Computer Science, November 2002, pp. 271–282
A. Shokrollahi, Raptor codes. IEEE Trans. Inf. Theory 52(6), 2551–2567 (2006)
T. J. Richardson, R. L. Urbanke, The capacity of low density parity check codes under message-passing decoding. IEEE Trans. Inf. Theory, 599–618 (2001)
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–72
R. Gallager, Low density parity check codes. IRE Trans. Inf. Theory, 21–28 (1962)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Rao, K.D. (2019). LT and Raptor Codes. In: Channel Coding Techniques for Wireless Communications. Forum for Interdisciplinary Mathematics. Springer, Singapore. https://doi.org/10.1007/978-981-15-0561-4_9
Download citation
DOI: https://doi.org/10.1007/978-981-15-0561-4_9
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0560-7
Online ISBN: 978-981-15-0561-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)