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 …

This paper considers the transmission of an infinite sequence of messages (a streaming
source) over a packet erasure channel, where every source message must be recovered …

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 …

In this paper, we investigate streaming codes over a three-node relay network. Source node
transmits a sequence of message packets to the destination via a relay. Source-to-relay and …

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 take a string of source symbols as input and output a string of coded
symbols in real time, which eliminate the queueing delay of traditional block codes and are …

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 …

Streaming codes take a string of source symbols as input and output a string of coded
symbols in real time, which effectively eliminate the queueing delay and are regarded as a …

An (a, b, τ) streaming code is a packet-level erasure code that can recover under a strict
delay constraint of τ time units, from either a burst of b erasures or else of a random …

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 …