Sliding Network Coding for URLLC

TL;DR

This paper introduces a sliding network coding scheme for URLLC that enhances reliability and reduces decoding delay compared to traditional repetition methods, ensuring highly reliable data transmission over erasure channels.

Contribution

It proposes a novel sliding network coding design that guarantees low decoding delay and improved reliability, with analytical validation of its superior error performance.

Findings

SNC achieves lower decoding error rates than K-repetition at the same spectral efficiency.

SNC provides highly reliable transmission with guaranteed decoding delay.

Analytical results confirm SNC's advantage in reliability over traditional methods.

Abstract

In this paper, we propose a network coding (NC) based approach to ultra-reliable low-latency communication (URLLC) over erasure channels. In transmitting multiple data packets, we demonstrate that the use of random NC can improve the reliability in terms of decoding error probability, while it incurs a longer decoding delay than a well-known K-repetition. To avoid a long decoding delay, we consider a sliding NC (SNC) design that allows a highly reliable transmission of each data packet with a guaranteed decoding delay. A few design examples are derived and their decoding error rates are analyzed. Through the analysis, we can show that the decoding error rate of SNC is much lower than that of K-repetition at the same spectral efficiency, which means a more reliable transmission can be achieved using SNC than K-repetition.