Exact Decoding Probability Under Random Linear Network Coding

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 infor...

Full description

Saved in:
Bibliographic Details
Published inIEEE communications letters Vol. 15; no. 1; pp. 67 - 69
Main Authors Trullols-Cruces, O, Barcelo-Ordinas, J M, Fiore, M
Format Journal Article Publication
LanguageEnglish
Published New York, NY IEEE 01.01.2011
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1089-7798
1558-2558
DOI10.1109/LCOMM.2010.110310.101480

Cover

Loading…
More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2010.110310.101480