Name
Abstract | ||
|---|---|---|
Sparse network coding (SNC) is a promising technique for reducing the complexity of random linear network coding (RLNC), by selecting a sparse coefficient matrix to code the packets. However, the performance of SNC for the average decoding delay (ADD) of the packets is still unknown. We study the performance of ADD and propose a Markov chain model to analyze this SNC metric. This model provides a ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/LCOMM.2018.2840139 | IEEE Communications Letters |
Keywords | Field | DocType |
Decoding,Delays,Markov processes,Receivers,Network coding,Analytical models,Encoding | Linear network coding,Markov process,Coefficient matrix,Computer science,Upper and lower bounds,Network packet,Markov chain,Algorithm,Real-time computing,Decoding methods,Encoding (memory) | Journal |
Volume | Issue | ISSN |
22 | 8 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amir Zarei | 1 | 0 | 0.34 |
| Peyman Pahlevani | 2 | 62 | 6.98 |
| Mansoor Davoodi | 3 | 62 | 6.87 |