On the Probability of Partial Decoding in Sparse Network Coding

Sparse Network Coding (SNC) has been a promising network coding scheme as an improvement for Random Linear Network Coding (RLNC) in terms of the computational complexity. However, in this literature, there has been no analytical expressions for the probability of decoding a fraction of source messages after transmission of some coded packets. In this work, we looked into the problem of the probability of decoding a fraction of source messages, i.e., partial decoding, in the decoder for a system which uses SNC. We exploited the Principle of Inclusion and Exclusion to derive expressions of partial decoding probability. The presented model predicts the probability of partial decoding with an average deviation of 6%. Our results show that SNC has a great potential for recovering a fraction of the source message, especially in higher sparsity and lower Galois Field size. Moreover, to achieve a better probability of partial decoding throughout transmissions, we define a sparsity tuning scheme that significantly increases the probability of partial decoding. Our results show that this tuning scheme achieves a 16% improvement in terms of probability of decoding a fraction of source packets with respect to traditional SNC.

[1]  Zhiyuan Yan,et al.  Rank deficient decoding of linear network coding , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[2]  Mohamed-Slim Alouini,et al.  Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications , 2017, IEEE Communications Surveys & Tutorials.

[3]  Ioannis Chatzigeorgiou,et al.  Opportunistic Relaying and Random Linear Network Coding for Secure and Reliable Communication , 2018, IEEE Transactions on Wireless Communications.

[4]  Saejoon Kim,et al.  Improved intermediate performance of rateless codes , 2009, 2009 11th International Conference on Advanced Communication Technology.

[5]  Krishna R. Narayanan,et al.  Weakly Secure Network Coding , 2005 .

[6]  Morten Videbæk Pedersen,et al.  Kodo: An Open and Research Oriented Network Coding Library , 2011, Networking Workshops.

[7]  Fabrice Rossi,et al.  Mean Absolute Percentage Error for regression models , 2016, Neurocomputing.

[8]  D. H. Fowler,et al.  The Binomial Coefficient Function , 1996 .

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

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

[11]  Daniel E. Lucani,et al.  A Markov Chain Model for the Decoding Probability of Sparse Network Coding , 2016, ArXiv.

[12]  Jianfei Cai,et al.  LT codes decoding: Design and analysis , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Nazanin Rahnavard,et al.  On the Intermediate Symbol Recovery Rate of Rateless Codes , 2012, IEEE Transactions on Communications.

[14]  Parastoo Sadeghi,et al.  Enabling a Tradeoff between Completion Time and Decoding Delay in Instantly Decodable Network Coded Systems , 2014, IEEE Transactions on Communications.

[15]  Andrea Tassi,et al.  Reliability of Broadcast Communications Under Sparse Random Linear Network Coding , 2018, IEEE Transactions on Vehicular Technology.

[16]  Devavrat Shah,et al.  Feedback-Based Online Network Coding , 2009, IEEE Transactions on Information Theory.

[17]  Daniel E. Lucani,et al.  Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services , 2015, IEEE Transactions on Communications.

[18]  Muriel Médard,et al.  A Perpetual Code for Network Coding , 2014, 2014 IEEE 79th Vehicular Technology Conference (VTC Spring).

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

[20]  Peyman Pahlevani,et al.  An Analytical Model for Perpetual Network Codes in Packet Erasure Channels , 2016, MACOM.

[21]  Ioannis Chatzigeorgiou,et al.  Probability of Partially Decoding Network-Coded Messages , 2016, IEEE Communications Letters.

[22]  Muriel Medard,et al.  Tunable sparse network coding , 2012 .

[23]  Peyman Pahlevani,et al.  On the Partial Decoding Delay of Sparse Network Coding , 2018, IEEE Communications Letters.

[24]  Andrew L. Jones,et al.  Binary systematic network coding for progressive packet decoding , 2015, 2015 IEEE International Conference on Communications (ICC).

[25]  P. Cameron.  Combinatorics: Topics, Techniques, Algorithms , 1995 .

[26]  Richard M. Karp,et al.  Finite length analysis of LT codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[27]  Peyman Pahlevani,et al.  An Analytical Model for Rank Distribution in Sparse Network Coding , 2019, IEEE Communications Letters.