Near-optimal streaming codes with linear field size

V Ramkumar, S Bhatnagar… - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
Streaming codes are codes designed to ensure erased packet recovery with a decoding-
delay deadline. In streaming code literature, an (a, b, w) sliding-window (SW) channel model …

Rate-optimal streaming codes over the three-node decode-and-forward relay network

S Singhvi, R Gayathri, PV Kumar - 2022 IEEE International …, 2022 - ieeexplore.ieee.org
In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to
random and burst packet erasures. The source wishes to transmit an infinite stream of …

Rate-optimal streaming codes with smaller field size under less-stringent decoding-delay requirements

S Bhatnagar, V Ramkumar… - 2022 IEEE Information …, 2022 - ieeexplore.ieee.org
Streaming codes are packet-level erasure-recovery codes which offer reliability in the
presence of burst or random packet erasures, while operating under a strict decoding-delay …

On Streaming Codes for Simultaneously Correcting Burst and Random Erasures

S Bhatnagar, B Chakraborty, PV Kumar - arXiv preprint arXiv:2405.06621, 2024 - arxiv.org
Streaming codes are packet-level codes that recover dropped packets within a strict
decoding-delay constraint. We study streaming codes over a sliding-window (SW) channel …

On Streaming Codes for Burst and Random Errors

S Bhatnagar, PV Kumar - arXiv preprint arXiv:2405.06606, 2024 - arxiv.org
Streaming codes (SCs) are packet-level codes that recover erased packets within a strict
decoding-delay deadline. Streaming codes for various packet erasure channel models such …

Explicit information-debt-optimal streaming codes with small memory

MN Krishnan, M Vajha, V Ramkumar… - … on Information Theory …, 2023 - ieeexplore.ieee.org
For a convolutional code in the presence of a symbol erasure channel, the information debt I
(t) at time t provides a measure of the number of additional code symbols required to recover …