Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sliding Network Coding for URLLC

Published 19 Nov 2021 in cs.IT and math.IT | (2111.10474v1)

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.

Citations (9)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.