Download Now Free registration required
The authors consider packet erasure correction coding for a streaming system where specific information needs to be decoded by specific deadlines, in order to ensure uninterrupted playback at the receiver. In their previous work, they gave a capacity-achieving code construction for the case of a fixed number of erasures. In this paper, they consider a sliding window erasure pattern where the number of erasures within windows of size above some threshold is upper bounded by a fraction of the window size, modeling a constraint on burstiness of the channel.
- Format: PDF
- Size: 244.12 KB