LT and Raptor Codes

  • K. Deergha Rao


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.


Degree Distribution Parity Check Matrix Input Symbol Output Symbol Source Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supplementary material (7 kb)
Supplementary material 1 (ZIP 7 kb)


  1. 1.
    Luby, M.: LT codes. In: Proceeding of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 271–282 (2002)Google Scholar
  2. 2.
    Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theor. 52(6), 2551–2567 (2006)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    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)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    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 2007Google Scholar
  5. 5.
    Gallager, R.: Low density parity check codes. IRE Trans. Inf. Theor. 8(1), 21–28 (1962)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Research and Training Unit for Navigational Electronics, College of EngineeringOsmania UniversityHyderabadIndia

Personalised recommendations