Real-time oblivious erasure correction with linear time decoding and constant feedback
Shashwat Silas

TL;DR
This paper introduces a new class of rateless erasure codes that achieve real-time oblivious decoding with significantly reduced feedback and decoding complexity, enabling efficient data transmission over unknown erasure channels.
Contribution
The authors develop codes that require fewer feedback messages and have faster decoding than previous methods, combining block erasure coding with real-time oblivious erasure correction techniques.
Findings
Expected feedback complexity reduced to O(1)
Decoding complexity improved to O(k')
Enhanced efficiency over prior rateless codes
Abstract
We continue the study of rateless codes for transmission of information across channels whose rate of erasure is unknown. In such a code, an infinite stream of encoding symbols can be generated from the message and sent across the erasure channel, and the decoder can decode the message after it has successfully collected a certain number of encoding symbols. A rateless erasure code is real-time oblivious if rather than collecting encoding symbols as they are received, the receiver either immediately decodes or discards each symbol it receives. Efficient real-time oblivious erasure correction uses a feedback channel in order to maximize the probability that a received encoding symbol is decoded rather than discarded. We construct codes which are real-time oblivious, but require fewer feedback messages and have faster decoding compared to previous work. Specifically, for a message of…
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.
