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

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 26; číslo 9; s. 2009 - 2013
Hlavní autoři: Chen, Wenlin, Lu, Fang, Dong, Yan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.09.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
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 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 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 matrix into the characterization of the homomorphism transform of the sparse distribution and to obtain a closed-form exact expression for the homomorphism transform of the sparse distribution. The former is solved by employing Möbius inversion theorem and the property of the homomorphism transform, and the latter is solved by employing the feature of the sparse distribution and the property of the nontrivial character of a finite field.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2022.3181722