English

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

Information Theory 2011-02-22 v2 Networking and Internet Architecture math.IT

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.

Keywords

Cite

@article{arxiv.1007.0522,
  title  = {Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality},
  author = {Ahmed Badr and Ashish Khisti and Emin Martinian},
  journal= {arXiv preprint arXiv:1007.0522},
  year   = {2011}
}

Comments

JSAC, May 2011, Special Issue on Trading Rate for Delay at the Transport and Application Layers, Shorter version will appear in Globecom 2010

R2 v1 2026-06-21T15:44:11.161Z