Title
An Analytical Model for Rank Distribution in Sparse Network Coding.
Abstract
Random linear network coding is a promising coding scheme to increase the robustness and reliability of network systems. However, one of its major drawbacks is the high computational complexity. Sparse Network Coding (SNC) was proposed to reduce the computational complexity at the expense of larger communication overhead. However, the performance evaluation of SNC is still a major research topic d...
Year
DOI
Venue
2019
10.1109/LCOMM.2019.2896626
IEEE Communications Letters
Keywords
Field
DocType
Sparse matrices,Decoding,Probability distribution,Mathematical model,Analytical models,Network coding,Computational complexity
Linear network coding,Computer science,Algorithm,Real-time computing,Coding (social sciences),Robustness (computer science),Probability distribution,Decoding methods,Sparse matrix,Computational complexity theory
Journal
Volume
Issue
ISSN
23
4
1089-7798
Citations 
PageRank 
References 
2
0.40
0
Authors
2
Name
Order
Citations
PageRank
Hadi Sehat121.75
Peyman Pahlevani2626.98