pith. sign in

arxiv: 1007.0522 · v2 · pith:L6L63LDMnew · submitted 2010-07-04 · 💻 cs.IT · cs.NI· math.IT

Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality

classification 💻 cs.IT cs.NImath.IT
keywords channelcodesdelaystreamingburst-erasurede-scoerasurerecovered
0
0 comments X
read the original abstract

Streaming erasure codes guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper introduces a new class of streaming codes: Diversity Embedded Streaming Erasure Codes (DE-SCo), that provide a flexible tradeoff between the channel quality and receiver delay. When the channel conditions are good, the source stream is recovered with a low delay, whereas when the channel conditions are poor the source stream is still recovered, albeit with a larger delay. Information theoretic analysis of the underlying burst-erasure broadcast channel reveals that DE-SCo achieve the minimum possible delay for the weaker user, without sacrificing the single-user optimal performance of the stronger user. Our constructions are explicit, incur polynomial time encoding and decoding complexity and outperform random linear codes over burst-erasure channels.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.