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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access Jg. 7; S. 43806 - 43819
Hauptverfasser:	Chen, Wenlin, Lu, Fang, Dong, Yan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!