.png){kind=icon}
Return
Exact Decoding Probability Under Random Linear Network Coding
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2010.110310.101480.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K >= N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to design the coding so to guarantee the correctness of the transmission. Our formulation represents an improvement over the current upper bound for the decoding probability, and provides theoretical grounding to simulative results in the literature.
Keywords:
Random linear network coding
wireless networks
error control
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave