Gamma Codes: A low-overhead linear-complexity network coding solution

We introduce a family of sparse random linear network codes with outer-code. Due to the bold role of the incomplete gamma function in their design, we call these codes “Gamma codes”. We show that Gamma codes outperform all the existing linear-complexity network coding solutions in terms of reception overhead, while keeping the encoding and decoding complexity linear in the block length.

[1]  Amin Shokrollahi,et al.  Capacity-achieving sequences for the erasure channel , 2002, IEEE Trans. Inf. Theory.

[2]  D. Lun,et al.  Methods for Efficient Network Coding , 2006 .

[3]  Emina Soljanin,et al.  Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding , 2010, IEEE Transactions on Information Theory.

[4]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[5]  K. Jain,et al.  Practical Network Coding , 2003 .

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

[7]  Xin Wang,et al.  Swifter: Chunked Network Coding for Peer-to-Peer Content Distribution , 2008, 2008 IEEE International Conference on Communications.

[8]  Sujay Sanghavi.  Intermediate Performance of Rateless Codes , 2007, 2007 IEEE Information Theory Workshop.

[9]  L. Flatto.  Limit Theorems for Some Random Variables Associated with Urn Models , 1982 .

[10]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[11]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[12]  Venkata N. Padmanabhan,et al.  Analyzing and Improving a BitTorrent Networks Performance Mechanisms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[14]  Jung-Fu Cheng,et al.  Some High-Rate Near Capacity Codecs for the Gaussian Channel , 1996 .

[15]  T. Ho,et al.  On Linear Network Coding , 2010 .

[16]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[17]  Amin Shokrollahi,et al.  New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity , 1999, AAECC.

[18]  Masoud Ardakani,et al.  On Raptor Code Design for Inactivation Decoding , 2012, IEEE Transactions on Communications.

[19]  Frank R. Kschischang,et al.  Sparse network coding with overlapping classes , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[20]  Norman Kaplan,et al.  A generalization of a result of Erdös and Rényi , 1977, Journal of Applied Probability.