A Perpetual Code for Network Coding

Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the coding vector. This adds to the overall energy consumption and is problematic for computational limited and battery driven platforms. In this work we present an approach to RLNC where the code is sparse and non-uniform. The sparsity allow for fast encoding and decoding, and the non- uniform protection of symbols enables recoding where the produced symbols are indistinguishable from those encoded at the source. The results show that the approach presented here provides a better trade- off between coding throughput and code overhead. In particular it can provide a coding overhead identical to RLNC but at significantly reduced computational complexity. It also allow for easy adjustment of this trade-off, which make it suitable for a broad range of platforms and applications. Finally it is easy to perform recoding and coding vectors can be efficiently represented.

[1]  Muriel Médard,et al.  On Code Parameters and Coding Vector Representation for Practical RLNC , 2011, 2011 IEEE International Conference on Communications (ICC).

[2]  Morten Videbæk Pedersen,et al.  Decoding Algorithms for Random Linear Network Codes , 2011, Networking Workshops.

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

[4]  Jörg Widmer,et al.  Network coding: an instant primer , 2006, CCRV.

[5]  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.

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

[7]  Emina Soljanin,et al.  Collecting Coded Coupons over Overlapping Generations , 2010, 2010 IEEE International Symposium on Network Coding (NetCod).

[8]  J. Heide,et al.  Network Coding for Mobile Devices - Systematic Binary Random Rateless Codes , 2009, 2009 IEEE International Conference on Communications Workshops.

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

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

[11]  Shenghao Yang,et al.  Large file transmission in network-coded networks with packet loss: a performance perspective , 2011, ISABEL '11.

[12]  Torben Larsen,et al.  Network Coding in the Real World , 2011 .

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

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

[15]  Stephen Ingram.  Minimum Degree Reordering Algorithms: A Tutorial , 2006 .