.png){kind=icon}
.png){kind=icon}
Return
Reliability of Broadcast Communications Under Sparse Random Linear Network Coding
.png){kind=icon}
OA
AI
DOI：10.1109/TVT.2018.2790436.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Ultrareliable point-to-multipoint communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse random linear network coding techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern of providing a tight approximation to the probability of a user recovering a data stream protected by this kind of coding technique. In particular, by exploiting the Stein-Chen method, we provide a novel and general performance framework applicable to any combination of system and service parameters, such as finite field sizes, lengths of the data stream, and level of sparsity. The deviation of the proposed approximation from Monte Carlo simulations is negligible, improving significantly on the state-of-the-art performance bounds.
Keywords:
Sparse random network coding
broadcast communication
multicast communications
Stein-Chen method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W