Analysis of decoding probability for systematic wireless network coding

Abstract

Systematic wireless network coding has been proposed as a potential solution to solve the major drawback of high encoding/decoding complexities of random linear network coding and to increase the decoding capability. However, the complete analysis of the decoding performance has not been fully derived. In this Letter, the authors derive closed-form expressions for the decoding probability under systematic network coding (SNC) over single-hop and multi-hop wireless networks. They validate the analysis by comparing simulation results. Their formulation provides a theoretical analysis for further understanding of the SNC and can be used to improve the current upper bound for the decoding probability.

MDS coding enabled proxy‐based Internet censorship circumvention system

“…When $$m \ge k$$, the receiver is proved to be able to decode all the source packets and recover the original data successfully with a very high probability if the size of $$\text{GF}(q)$$ is large enough [8]. The essence of the decoding process is Gaussian elimination [9], thus at least k encoded packets are required to recover the original data. Otherwise, if $$m < k$$, no part of the original data can be retrieved [10, 11].…”

Distributed Systematic Network Coding for Reliable Content Uploading in Wireless Multimedia Sensor Networks

“…First, we describe the decoding probability of SNC over one-hop transmission with a single ON and CH in the first phase derived in [ 28 ]. Sender encodes original packets into SNC packets for transmission.…”