In this thesis, we consider error-correction codes for systems which have burst erasure channels, but where the packet delay is constrained. The packet delay itself is the time di erence between the arrival of a source packet at the encoder and the reconstruction of that source packet at the decoder. While such a framework was introduced by Martinian (2004) and his co-authors, several problems remain open.
We make three contributions in this thesis. First we develop a rigorous converse proof for the point-to-point case and thus complete the result of Martinian (2004). Our proof technique is also applied to a multicast channel model and new results are obtained. Secondly we study the case when there are multiple parallel links between the encoder and decoder and obtain the capacity in some special cases. Finally we study a setup when there are multiple source streams, each with a di erent delay constraint, and obtain capacity results.
| Identifer | oai:union.ndltd.org:TORONTO/oai:tspace.library.utoronto.ca:1807/31318 |
| Date | 14 December 2011 |
| Creators | Lui, Devin Waine-Tak |
| Contributors | Khisti, Ashish |
| Source Sets | University of Toronto |
| Language | en_ca |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.002 seconds