Design of short-length message fountain code for erasure channel transmission

The emergence of practical fountain codes (i.e. LT and Raptor codes) may be a presage of Internet evolution. However, the existing fountain codes are only efficient to a long-length message and it will not be useful to current Internet as the majority of which are short-length messages. This manuscript demonstrates the preliminary design of our short-length message fountain code. Our proposed fountain code is simple in design and it is able to achieve a perfect decoding inefficiency ε = 0 in an ideal channel and ε = 1 even in a channel of erasure probability p = 0.5.

[1]  Ian D. Marsland,et al.  A Comparison of Rateless Codes at Short Block Lengths , 2008, 2008 IEEE International Conference on Communications.

[2]  Chao Zhang,et al.  Designing of Fountain Codes with Short Code-Length , 2007, 2007 3rd International Workshop on Signal Design and Its Applications in Communications.

[3]  Alex C. Snoeren,et al.  Decongestion Control , 2006, HotNets.

[4]  Antonio Fernández,et al.  A game theoretic comparison of TCP and digital fountain based protocols , 2007, Comput. Networks.

[5]  John S Dodgson LAW OF THE JUNGLE , 1997 .

[6]  Alexandre Proutière,et al.  Is the ''Law of the Jungle'' Sustainable for the Internet? , 2009, IEEE INFOCOM 2009.

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

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