LT Codes Decoding: Design and Analysis. Feng Lu Chuan Heng Foh , Jianfei Cai and Liang- Tien Chia Information Theory, 2009. ISIT 2009. IEEE International Symposium on . Outline . Introduction Full rank LT decoding process LT decoding drawbacks Full rank decoding
LT Codes Decoding: Design and Analysis
Chuan HengFoh, JianfeiCai and Liang- TienChia
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
 A. Shokrollahi, "Raptor Codes," IEEE Transactions on Information Theory, Vol. 52, no. 6, pp. 2551-2567, 2006.
 E. Hyytia,T. Tirronen, J. Virtamo, "Optimal Degree Distribution for LT Codes with Small Message Length," The 26th IEEE International Conference on Computer Communications INFOCOM, pp. 2576-2580,
Perform very well 
Often encountered difficulties
Only handle symbols k≤10
The decoding complexity increase significantly
 J. Gentle, "Numerical Linear Algebra for Application in Statistics," pp. 87-91, Springer-Verlag, 1998
Trigger Wiedemannalgorithm to recover a borrowed symbol
[I I] D. Wiedemann, "Solving sparse linear equations over finite fields," IEEE Transactions on Information Theory, Vol. 32, no. I, pp. 54-62, 1986.
 E. Berlekamp, "Algebraic Coding Theory," McGraw-Hili, New York,1968.
 J. Massey, "Shift-register synthesis and BCII decoding," IEEE Transactions on Information Theory, Vol. 15, no. I, pp. 122-127, 1969.
Our proposed algorithm guarantees the success of the decoding.
 R.A. Hom, C.R. Johnson, "Matrix Analysis," Cambridge University Press, 1985
 R. Karp, M. Luby, A. Shokrollahi,
“Finite length analysis of LT codes,”
The IEEE International Symposium
on Information Theory, 2004.