2019/04/11 by Elad Domanovitz, Domanovitz, Elad, Silas L. Fong +3 · 4 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1904.06212
openalex publication_date 2019/04/11 · openalex created_date 2022/07/24 · openalex updated_date 2026/07/28
This paper considers the transmission of an infinite sequence of messages (a\nstreaming source) over a packet erasure channel, where every source message\nmust be recovered perfectly at the destination subject to a fixed decoding\ndelay. While the capacity of a channel that introduces only bursts of erasures\nis well known, only recently, the capacity of a channel with either one burst\nof erasures or multiple arbitrary erasures in any fixed-sized sliding window\nhas been established. However, the codes shown to achieve this capacity are\neither non-explicit constructions (proven to exist) or explicit constructions\nthat require large field size that scales exponentially with the delay. This\nwork describes an explicit rate-optimal construction for admissible channel and\ndelay parameters over a field size that scales only quadratically with the\ndelay.\n