A Homomorphism Transform Based Analysis of Sparse Random Linear Network Coding Over Erasure Channels

In this letter, we provide a method for deriving the first exact expression for the decoding success probability of sparse random linear network coding over erasure channels. The key idea of the proposed method is to transform the characterization of the full rank probability of a sparse random matr...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE communications letters Ročník 26; číslo 9; s. 2009 - 2013
Hlavní autori:	Chen, Wenlin, Lu, Fang, Dong, Yan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.09.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Additives Channels Coding Decoding Encoding Fields (mathematics) full rank probability Homomorphisms Receivers Reliability Sparse matrices Sparse random linear network coding Transforms
ISSN:	1089-7798, 1558-2558
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!