Streaming codes for variable-size messages
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 …
packet loss during transmission. The effect of packet losses can be alleviated by using …
Broadcast approach meets network coding for data streaming
For data streaming applications, existing solutions are not yet able to close the gap between
high data rates and low delay. This work considers the problem of data streaming under …
high data rates and low delay. This work considers the problem of data streaming under …
Learning-augmented streaming codes are approximately optimal for variable-size messages
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 …
with packet loss. Streaming codes are a class of codes best suited for this setting. A key …
High rate streaming codes over the three-node relay network
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 …
transmits a sequence of message packets to the destination via a relay. Source-to-relay and …
Learning-augmented streaming codes for variable-size messages under partial burst losses
Recovering bursts of lost packets in real-time is crucial to multimedia live-streaming
applications' quality-of-experience (QoE). Streaming codes optimally handle the unique …
applications' quality-of-experience (QoE). Streaming codes optimally handle the unique …
Adaptive relaying for streaming erasure codes in a three node relay network
This paper investigates adaptive streaming codes over a three-node relayed network. In this
setting, a source node transmits a sequence of message packets to a destination with help …
setting, a source node transmits a sequence of message packets to a destination with help …
Explicit rate-optimal streaming codes with smaller field size
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 …
a sliding window channel which allows either a burst erasure of size or random erasures …
Streaming erasure codes over multi-hop relay network
A typical path over the internet is composed of multiple hops. When considering the
transmission of a sequence of messages (streaming messages) through packet erasure …
transmission of a sequence of messages (streaming messages) through packet erasure …
Near-optimal streaming codes with linear field size
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 …
On the optimal delay growth rate of multi-hop line networks: Asymptotically delay-optimal designs and the corresponding error exponents
Multi-hop line networks have emerged as an important abstract model for modern and
increasingly dense communication networks. In addition, the growth of real-time and mission …
increasingly dense communication networks. In addition, the growth of real-time and mission …