Exact Decoding Probability of Sparse Random Linear Network Coding for Reliable Multicast

Sparse random linear network coding (SRLNC) used as a class of erasure codes to ensure the reliability of multicast communications has been widely investigated. However, an exact expression for the decoding success probability of SRLNC is still unknown, and existing expressions are either asymptotic or approximate. In this paper, we derive an exact expression for the decoding success probability of SRLNC. The key to achieving this is to propose a criterion that a vector is contained in a subspace. To obtain this criterion, we construct a basis of a subspace, with respect to this basis, the coordinates of a vector are known, based on a maximal linearly independent set of the columns of a matrix. The exactness and the computation of the derived expression are demonstrated by a simple example.

[1]  János Komlós,et al.  Singularity Probabilities for Random Matrices over Finite Fields , 2001, Combinatorics, Probability and Computing.

[2]  Wai Ho Mow,et al.  Singularity Probability Analysis for Sparse Random Linear Network Coding , 2011, 2011 IEEE International Conference on Communications (ICC).

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

[4]  Yan Dong,et al.  The Rank Distribution of Sparse Random Linear Network Coding , 2019, IEEE Access.

[5]  Amin Shokrollahi,et al.  Raptor codes , 2011, IEEE Transactions on Information Theory.

[6]  David P. Robbins,et al.  The asymptotic probability that a random biased matrix is invertible , 1990, Discret. Math..

[7]  Pascal Frossard,et al.  Network Coding Meets Multimedia: A Review , 2012, IEEE Transactions on Multimedia.

[8]  Michael Mitzenmacher,et al.  A digital fountain approach to asynchronous reliable multicast , 2002, IEEE J. Sel. Areas Commun..

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

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

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

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

[13]  Daniel E. Lucani,et al.  An Analytical Model for Sparse Network Codes: Field Size Considerations , 2020, IEEE Communications Letters.

[14]  V. F. Kolchin,et al.  Random Graphs and Systems of Linear Equations in Finite Fields , 1994, Random Struct. Algorithms.

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

[16]  Colin Cooper,et al.  On the rank of random matrices , 2000, Random Struct. Algorithms.

[17]  Xiaolin Li,et al.  Rank Distribution Analysis for Sparse Random Linear Network Coding , 2011, 2011 International Symposium on Networking Coding.

[18]  Marco Fiore,et al.  Exact Decoding Probability Under Random Linear Network Coding , 2010, IEEE Communications Letters.

[19]  Colin Cooper,et al.  On the distribution of rank of a random matrix over a finite field , 2000, Random Struct. Algorithms.

[20]  Richard M. Karp,et al.  The rank of sparse random matrices over finite fields , 1997, Random Struct. Algorithms.

[21]  Fang Lu,et al.  Improved Expression for Rank Distribution of Sparse Random Linear Network Coding , 2020 .