On erasure correction coding for streaming
Author
Tekin, Ömer Faruk
Ho, T.
Yao, H.
Jaggi, S.
Date
2012Source Title
Proceedings of the Information Theory and Applications Workshop, ITA 2012
Publisher
IEEE
Pages
221 - 226
Language
English
Type
Conference PaperItem Usage Stats
130
views
views
109
downloads
downloads
Abstract
We 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 our previous work [1], we gave a capacity-achieving code construction for the case of a fixed number of erasures. In this work, we 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. We lower bound the rates achievable by our previous code construction as a fraction of the capacity region, which approaches to one as the window size threshold and the initial playout delay increase simultaneously.
Keywords
BurstinessCapacity regions
Code construction
Erasure correction
Fixed numbers
Lower bounds
Playout delay
Sliding window
Specific information
Window size
Information theory