Graph-based LT and raptor codes

This paper deals with LT and Raptor codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. The performance measure for such family of codes is the efficiency, i.e., the average amount of redundancy needed to decode the information bits. We consider the new class of graph-based LT and Raptor codes, we analyze their efficiency and we show that the optimal degree distribution of the LT code depends on the rate of the precoder.

[1]  S. Benedetto,et al.  Efficiency of Precode-Only Raptor codes and Turbo-Fountain Codes , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[2]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[3]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[6]  Sergio Benedetto,et al.  Analysis of PCO Raptor codes and Turbo-Fountain Codes on Noiseless Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[7]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[8]  Joachim Hagenauer,et al.  The Turbo-Fountain and its Application to Reliable Wireless Broadcast , 2005 .