Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sliding Network Coding for URLLC (2111.10474v1)

Published 19 Nov 2021 in cs.IT and math.IT

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

We haven't generated a summary for this paper yet.