Improved finite-length Luby-transform codes in the binary erasure channel

Fountain codes were introduced to provide high reliability and scalability and low complexities for networks such as the Internet. Luby-transform (LT) codes, which are the first realisation of Fountain codes, achieve the capacity of the binary erasure channel (BEC) asymptotically and universally. Most previous work on single-layer Fountain coding targets the design via the right degree distribution. The left degree distribution of an LT code is left as a Poisson to protect the universality. For finite lengths, this is no longer an issue; thus, the author's focus is on designing better codes for the BEC at practical lengths. Their left degree shaping provides codes outperforming LT codes and all other competing schemes in the literature. At a bit error rate of 10−7 and packet length k = 256, their scheme provides a realised rate of 0.6 which is 23.5% higher than that of Sorensen et al.’s decreasing-ripple-size scheme.

[1]  Thomas E. Fuja,et al.  The Design and Performance of Distributed LT Codes , 2007, IEEE Transactions on Information Theory.

[2]  Petar Popovski,et al.  Design and Analysis of LT Codes with Decreasing Ripple Size , 2010, IEEE Transactions on Communications.

[3]  Ming Xiao,et al.  Error Floor Analysis of LT Codes over the Additive White Gaussian Noise Channel , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[4]  Shahram Yousefi,et al.  Improved systematic fountain codes in AWGN channel , 2013, 2013 13th Canadian Workshop on Information Theory.

[5]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[6]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[7]  Nazanin Rahnavard,et al.  Finite-length unequal error protection rateless codes: design and analysis , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[8]  Guangxia Li,et al.  A novel degree distribution algorithm of LT codes , 2008, 2008 11th IEEE International Conference on Communication Technology.

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

[10]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[11]  Il-Min Kim,et al.  Binary Soliton-Like Rateless Coding for the Y-Network , 2011, IEEE Transactions on Communications.

[12]  Weiler Alves Finamore,et al.  Improving the performance of LT codes , 2010, 2010 7th International Symposium on Wireless Communication Systems.

[13]  Jorma Virtamo,et al.  Optimizing the Degree Distribution of LT codes with an Importance Sampling Approach , 2006 .

[14]  Amin Shokrollahi,et al.  Analysis of the Second Moment of the LT Decoder , 2009, IEEE Transactions on Information Theory.

[15]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[16]  Nazanin Rahnavard,et al.  Rateless Codes With Unequal Error Protection Property , 2007, IEEE Transactions on Information Theory.