An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures

Elad Domanovitz, Silas L. Fong, Ashish Khisti

Research output: Contribution to journalArticlepeer-review

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 has been known for more than fifteen years, 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, explicit codes shown to achieve this capacity for any admissible set of parameters require a large field size that scales exponentially with the delay. Recently, it has been shown that there exist codes that achieve the capacity with field size which scales quadratically with the delay. However, explicit constructions were shown only to specific combinations of parameters. This work describes an explicit rate-optimal construction for all admissible channel and delay parameters over a field size that scales quadratically with the delay.

Original languageEnglish
Pages (from-to)47-65
Number of pages19
JournalIEEE Transactions on Information Theory
Volume68
Issue number1
DOIs
StatePublished - 1 Jan 2022
Externally publishedYes

Keywords

  • Streaming codes
  • delays
  • forward error correction

Fingerprint

Dive into the research topics of 'An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures'. Together they form a unique fingerprint.

Cite this