
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.
Computational complexity, Delay, Random linear network coding (RLNC), Perpetual coding
Computational complexity, Delay, Random linear network coding (RLNC), Perpetual coding
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
