Online Fountain Codes With Low Overhead

An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formalize the problem of online fountain code construction, and propose new online fountain codes that outperform known ones in having factor 3-5 lower redundancy overhead. The bounding of the code overhead is carried out using the analysis of the dynamics of random-graph processes.

[1]  Jon Feldman,et al.  Growth codes: maximizing sensor network data persistence , 2006, SIGCOMM.

[2]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[3]  Amin Shokrollahi,et al.  On-line fountain codes for semi-random loss channels , 2011, 2011 IEEE Information Theory Workshop.

[4]  Jeffrey Considine.  Generating Good Degree Distributions for Sparse Parity Check Codes using Oracles , 2001 .

[5]  P. Spasojevic,et al.  ARQ with Doped Fountain Decoding , 2008, 2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications.

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

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

[8]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[9]  A. Beimel,et al.  RT Oblivious Erasure Correcting , 2004, IEEE/ACM Transactions on Networking.

[10]  Sachin Agarwal,et al.  Rateless Coding with Feedback , 2009, IEEE INFOCOM 2009.

[11]  B. Bollobás.  The evolution of random graphs , 1984 .

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

[13]  Nazanin Rahnavard,et al.  LT-AF codes: LT codes with Alternating Feedback , 2013, 2013 IEEE International Symposium on Information Theory.