Notes on "Exact Decoding Probability Under Random Linear Network Coding"

In a recent letter, Trullols-Cruces et al. derived the exact decoding probability P ns (K,N) that a receiver node obtained N linearly independent coded packets among K (K≥ N) received coded packets, when the source node uses a random linear coding scheme over a Galois Field GF(q). They discussed P n...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE communications letters Ročník 16; číslo 5; s. 720 - 721
Hlavní autor:	Zhao, Xubo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.05.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Applied sciences Coding Coding, codes Decoding decoding probability Derivation Educational institutions Encoding Exact sciences and technology Information, signal and communications theory Matrices Network coding Networks Random linear coding Receivers Signal and communications theory Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Vectors wireless networks Finite field Linear coding Packet switching Linear combination Random linear coding Wireless telecommunication decoding probability Network coding Wireless network wireless networks Decoding Random coding
ISSN:	1089-7798, 1558-2558
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	In a recent letter, Trullols-Cruces et al. derived the exact decoding probability P ns (K,N) that a receiver node obtained N linearly independent coded packets among K (K≥ N) received coded packets, when the source node uses a random linear coding scheme over a Galois Field GF(q). They discussed P ns (K,N) both in the case of the source node sending the random linear combination of the original packets, including all-zero combinations, as well as the case of excluding all-zero combinations. However, their derivations are a bit complicated. In this note, we demonstrate simple derivations of the exact decoding probability P ns (K,N) in both cases. Furthermore, we point out that there is a more succinct expression of P ns (K,N) for the latter case.
Bibliografie:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2012.041112.112564