Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality
Ahmed Badr, Ashish Khisti, Emin Martinian

TL;DR
This paper introduces diversity embedded streaming erasure codes (DE-SCo) that adaptively balance delay and reliability over burst-erasure channels, achieving optimal delay for weaker users without compromising performance.
Contribution
The paper proposes DE-SCo, a novel class of codes that provide flexible delay-reliability tradeoffs, and constructs MU-SCo codes that optimize rate, delay, and burst length.
Findings
DE-SCo achieve minimum delay for weaker users.
DE-SCo adapt to channel conditions, providing low delay in good conditions.
MU-SCo codes optimize rate, delay, and burst length tradeoffs.
Abstract
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper introduces 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 performance of the stronger user. A larger class of multicast streaming erasure codes (MU-SCo) that achieve optimal tradeoff between rate, delay and erasure-burst length is also constructed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
