Generalized Simple Streaming Codes from MDS Codes
Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar

TL;DR
This paper introduces generalized simple streaming codes that leverage MDS codes with multiple symbols per packet, enhancing rate and simplicity for reliable low-latency communication over delay-constrained channels.
Contribution
It extends simple streaming codes by allowing multiple code symbols per packet, improving rate while maintaining low complexity and leveraging MDS codes.
Findings
Achieves higher code rates compared to previous SS codes.
Maintains low-complexity decoding with simplified construction.
Provides theoretical characterization of maximum code rate under constraints.
Abstract
Streaming codes represent a packet-level FEC scheme for achieving reliable, low-latency communication. In the literature on streaming codes, the commonly-assumed Gilbert-Elliott channel model, is replaced by a more tractable, delay-constrained, sliding-window (DCSW) channel model that can introduce either random or burst erasures. The known streaming codes that are rate optimal over the DCSW channel model are constructed by diagonally embedding a scalar block code across successive packets. These code constructions have field size that is quadratic in the delay parameter and have a somewhat complex structure with an involved decoding procedure. This led to the introduction of simple streaming (SS) codes in which diagonal embedding is replaced by staggered-diagonal embedding (SDE). The SDE approach reduces the impact of a burst of erasures and makes it possible to construct…
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.
