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...
Main Authors: | Wenlin Chen, Fang Lu, Yan Dong |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8672897/ |
Similar Items
-
On Design and Efficient Decoding of Sparse Random Linear Network Codes
by: Ye Li, et al.
Published: (2017-01-01) -
Technique detection software for Sparse Matrices
by: KHAN Muhammad Taimoor, et al.
Published: (2009-12-01) -
A Survey of Low-Rank Updates of Preconditioners for Sequences of Symmetric Linear Systems
by: Luca Bergamaschi
Published: (2020-04-01) -
Hyperspectral Sparse Unmixing With Spectral-Spatial Low-Rank Constraint
by: Fan Li, et al.
Published: (2021-01-01) -
Direct sparse matrix methods for interior point algorithms.
by: Jung, Ho-Won.
Published: (1990)