Return
Small Field Size Streaming Code Constructions
DOI:10.1109/TIT.2025.3625846.png)
Abstract
En 中文
Streaming codes are codes designed to ensure erased packet recovery within a decoding-delay deadline. In streaming code literature, a sliding-window (SW) channel model is considered called the (a, b, w)-SW channel model. In the (a, b, w)-SW channel, within any window of w time slots, either a burst of <= b consecutive packets, or else <= a packets at random can be erased. An (a, b, w, r) streaming code is capable of recovering messages under a decoding-delay of r time slots, from any erasure pattern produced by the (a, b, w)-SW channel. For any given (a, b, w)-SW channel, the minimum delay with which the maximum rate possible over this channel can be achieved is tau = w-1. Rate-optimal constructions of streaming codes for parameters of the form (a, b, w, tau = w-1) are known, and these constructions require a field size that is quadratic in w in general. In this paper, we show that is possible to construct linear field size streaming codes for all {a, b, w} parameters, by sacrificing a little on either delay or rate. Moreover, we characterize the existence of binary, rate-optimal (a, b, w, tau = w-1) streaming codes constructed via the popular technique of diagonal embedding. Further, under a less-stringent decoding-delay requirement of tau = (w + b-a-1), it is shown that binary, rate-optimal streaming codes can be constructed for certain parameters. Streaming codes for a more general class of SW channels that allow unerased packets within a burst erasure are also investigated.
Keywords:
Codes
Channel models
Delays
Vectors
Symbols
Receivers
Low latency communication
Encoding
Decoding
Vehicular ad hoc networks
Streaming codes
sliding-window channel
burst and random erasures
low-latency communication
Journal
I
IF:
2.9
Papers:
317
Citations:
0

