On erasure correction coding for streaming

Date
2012
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the Information Theory and Applications Workshop, ITA 2012
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
221 - 226
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Series
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.

Course
Other identifiers
Book Title
Keywords
Burstiness, Capacity regions, Code construction, Erasure correction, Fixed numbers, Lower bounds, Playout delay, Sliding window, Specific information, Window size, Information theory
Citation
Published Version (Please cite this version)