Live communication is ubiquitous, and frequently must contend with reliability issues due to
packet loss during transmission. The effect of packet losses can be alleviated by using …

Real-time streaming communication requires a high quality-of-service despite contending
with packet loss. Streaming codes are a class of codes best suited for this setting. A key …

Streaming codes are a class of packet-level erasure codes that ensure packet recovery over
a sliding window channel which allows either a burst erasure of size or random erasures …

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 …

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 …

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 …

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 …

Streaming codes may be regarded as packet-level convolutional codes that guarantee
recovery from packet erasures under a strict decoding-delay constraint and are hence …

Motivated by modern network communication applications which require low latency, we
study codes that correct erasures with low decoding delay. We provide a simple explicit …

Streaming codes represent a packet-level FEC scheme for achieving reliable, low-latency
communication. In the literature on streaming codes, the commonly-assumed Gilbert-Elliott …