Erasure Coding for Real-Time Streaming
arXiv:1207.3582 · doi:10.1109/ISIT.2012.6284055
Abstract
We consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission to the receiver over a packet erasure link. Each message must subsequently be decoded at the receiver within a given delay from its creation time. The goal is to construct an erasure correction code that achieves the maximum message size when all messages must be decoded by their respective deadlines under a specified set of erasure patterns (erasure model). We present an explicit intrasession code construction that is asymptotically optimal under erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts of a limited length.
Extended version of a conference paper in the IEEE International Symposium on Information Theory (ISIT), July 2012. 12 pages, 3 figures
References in corpus (1)
Cited by in corpus (5)
- Layered Constructions for Low-Delay Streaming Codes
- Erasure Coding for Real-Time Streaming
- Streaming-Codes for Multicast over Burst Erasure Channels
- On the Construction of Jointly Superregular Lower Triangular Toeplitz Matrices
- Robust Streaming Erasure Codes based on Deterministic Channel Approximations