Name
Abstract | ||
|---|---|---|
Random Linear Network Coding (RLNC) is an erasure network coding technique used to improve communication and content distribution. However, RLNC is not efficient for data streaming applications, e.g., video streaming, where the data packets must be delivered in order and decoded within a tight deadline. Although some approaches have been proposed, these approaches have high computational complexity or require continuous feedback from the destination. Perpetual coding is an alternative approach which reduces the computational complexity and decrease per packet decoding delay at the destination. This paper focuses on improving decoding delay of communication systems by designing coding schemes based on Perpetual coding. Our simulation results demonstrate that the proposed schemes achieve a gain of 67% under a variety of channel conditions. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s11277-021-08497-x | WIRELESS PERSONAL COMMUNICATIONS |
Keywords | DocType | Volume |
Computational complexity, Delay, Random linear network coding (RLNC), Perpetual coding | Journal | 120 |
Issue | ISSN | Citations |
2 | 0929-6212 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanaz Mohammadi | 1 | 0 | 0.34 |
| Peyman Pahlevani | 2 | 0 | 0.34 |
| Daniel E. Lucani | 3 | 236 | 42.29 |