Tekin, Ömer FarukHo, T.Yao, H.Jaggi, S.2016-02-082016-02-082012http://hdl.handle.net/11693/28217Date of Conference: 5-10 February 2012Conference Name: Information Theory and Applications Workshop, ITA 2012We 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.EnglishBurstinessCapacity regionsCode constructionErasure correctionFixed numbersLower boundsPlayout delaySliding windowSpecific informationWindow sizeInformation theoryConference Paper10.1109/ITA.2012.6181798