The Rank Distribution of Sparse Random Linear Network Coding

Sparse random linear network coding (SRLNC) is a promising solution for reducing the complexity of random linear network coding (RLNC). RLNC can be modeled as a linear operator channel (LOC). It is well known that the normalized channel capacity of LOC is characterized by the rank distribution of th...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE access Ročník 7; s. 43806 - 43819
Hlavní autori:	Chen, Wenlin, Lu, Fang, Dong, Yan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Approximation Channel capacity Coding Complexity theory Decoding Encoding Fields (mathematics) Linear operators Mathematical analysis Network coding Operators (mathematics) Probability Rank distribution Sparse matrices sparse random linear network coding Sparsity Transfer matrices
ISSN:	2169-3536, 2169-3536
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!