An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures
From MaRDI portal
Publication:5030267
DOI10.1109/TIT.2021.3121101zbMATH Open1489.94060arXiv1904.06212OpenAlexW3206731135MaRDI QIDQ5030267
Elad Domanovitz, Silas L. Fong, Ashish Khisti
Publication date: 17 February 2022
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: This paper considers the transmission of an infinite sequence of messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at the destination subject to a fixed decoding delay. While the capacity of a channel that introduces only bursts of erasures is well known, only recently, the capacity of a channel with either one burst of erasures or multiple arbitrary erasures in any fixed-sized sliding window has been established. However, the codes shown to achieve this capacity are either non-explicit constructions (proven to exist) or explicit constructions that require large field size that scales exponentially with the delay. This work describes an explicit rate-optimal construction for admissible channel and delay parameters over a field size that scales only quadratically with the delay.
Full work available at URL: https://arxiv.org/abs/1904.06212
Related Items (3)
Unequal Error Protection for Streaming Media Based on Rateless Codes ⋮ Comments on "Optimal Erasure Protection for Scalably Compressed Video Streams With Limited Retransmission ⋮ Optimal erasure protection assignment for scalable compressed data with small channel packets and short channel codewords
This page was built for publication: An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030267)
