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 …
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
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 …
random and burst packet erasures. The source wishes to transmit an infinite stream of …
Locally recoverable streaming codes for packet-erasure recovery
V Ramkumar, M Vajha… - 2021 IEEE Information …, 2021 - ieeexplore.ieee.org
Streaming codes are a class of packet-level erasure codes that are designed with the goal of
ensuring recovery in low-latency fashion, of erased packets over a communication network …
ensuring recovery in low-latency fashion, of erased packets over a communication network …
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 …
presence of burst or random packet erasures, while operating under a strict decoding-delay …
On Information-Debt-Optimal Streaming Codes With Small Memory
In the context of an (n, k, m) convolutional code where k is the number of message symbols,
n the number of code symbols and m the memory, Martinian [1] introduced the concept of …
n the number of code symbols and m the memory, Martinian [1] introduced the concept of …
On the performance analysis of streaming codes over the gilbert-elliott channel
M Vajha, V Ramkumar, M Jhamtani… - 2021 IEEE Information …, 2021 - ieeexplore.ieee.org
The Gilbert-Elliot (GE) channel is a commonlyaccepted model for packet erasures in
networks. Streaming codes are a class of packet-level erasure codes designed to provide …
networks. Streaming codes are a class of packet-level erasure codes designed to provide …
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 …
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 …
decoding-delay deadline. Streaming codes for various packet erasure channel models such …
On Multi-Path Streaming Codes
V Ramkumar, S Bhatnagar… - … National Conference on …, 2024 - ieeexplore.ieee.org
Streaming codes are a class of packet-level erasure-recovery codes, designed to recover
from dropped packets within a strict decoding-delay constraint. These codes are well …
from dropped packets within a strict decoding-delay constraint. These codes are well …
[HTML][HTML] Construction of systematic (k+ 1, k) memory MDS sliding window codes over embedded fields
In this paper, based on the structure of embedded fields, we investigate explicit construction
of systematic (k+ 1, k) mMDS sliding window codes with memory m= 2, 3. First, over GF (2 lh) …
of systematic (k+ 1, k) mMDS sliding window codes with memory m= 2, 3. First, over GF (2 lh) …