Name
Abstract | ||
|---|---|---|
We consider a real-time streaming system where messages are created sequentially at the source, and are encoded for transmission over a packet erasure channel. Each message must subsequently be decoded at the receiver within a given delay from its creation time. We consider code design and maximum message rates when all messages must be decodable by their respective deadlines under a specified set of erasure patterns (erasure model). Specifically, we provide a code construction that achieves the optimal rate for an asymptotic number of messages, under erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts of a limited length. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISIT.2012.6284055 | 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) |
Keywords | DocType | Volume |
real time systems,upper bound,encoding,resource management,erasure coding,decoding,channel coding,sliding window,vectors | Journal | abs/1207.3582 |
Citations | PageRank | References |
15 | 0.83 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Derek Leong | 1 | 161 | 10.86 |
| Tracey Ho | 2 | 775 | 59.30 |