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

08/26/2021
by   Wenlin Chen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2020

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

Reliable and low latency multicast communication is important for future...
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
08/14/2022

Block Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications

Low-rate and short-packet transmissions are important for ultra-reliable...
research
07/13/2020

Orthogonal Sparse Superposition Codes

This paper presents a new class of sparse superposition codes for effici...
research
12/13/2021

Spark Optimization of Linear Codes for Reliable Data Delivery by Relay Drones

Data gathering operations in remote locations often rely on relay drones...
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/07/2019

One-step Majority-logic Decoding with Subspace Designs

Rudoph (1967) introduced one-step majority logic decoding for linear cod...

Please sign up or login with your details

Forgot password? Click here to reset