The Decoding Success Probability of Sparse Random Linear Network Coding for Multicast

10/12/2020
by   Wenlin Chen, et al.
0

Reliable and low latency multicast communication is important for future vehicular communication. Sparse random linear network coding approach used to ensure the reliability of multicast communication has been widely investigated. A fundamental problem of such communication is to characterize the decoding success probability, which is given by the probability of a sparse random matrix over a finite field being full rank. However, the exact expression for the probability of a sparse random matrix being full rank is still unknown, and existing approximations are recursive or not consistently tight. In this paper, we provide a tight and closed-form approximation to the probability of a sparse random matrix being full rank, by presenting the explicit structure of the reduced row echelon form of a full rank matrix and using the product theorem. Simulation results show that our proposed approximation is of high accuracy regardless of the generation size, the number of coded packets, the field size and the sparsity, and tighter than the state-of-the-art approximations for a large range of parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/26/2021

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

Sparse random linear network coding (SRLNC) used as a class of erasure c...
research
05/26/2017

Reliability of Broadcast Communications Under Sparse Random Linear Network Coding

Ultra-reliable Point-to-Multipoint (PtM) communications are expected to ...
research
07/28/2019

On the Probability of Partial Decoding in Sparse Network Coding

Sparse Network Coding (SNC) has been a promising network coding scheme a...
research
04/21/2011

Rank Minimization over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

This paper establishes information-theoretic limits in estimating a fini...
research
10/30/2019

Rate Analysis of Ultra-Reliable Low-Latency Communications in Random Wireless Networks

In this letter, we analyze the achievable rate of ultra-reliable low-lat...
research
05/10/2018

Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes

Multishot network coding is considered in a worst-case adversarial setti...
research
11/21/2018

On Intercept Probability Minimization under Sparse Random Linear Network Coding

This paper considers a network where a node wishes to transmit a source ...

Please sign up or login with your details

Forgot password? Click here to reset