Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels
Farrokh Etezadi, Ashish Khisti, Mitchell Trott

TL;DR
This paper investigates the minimum compression rate needed for zero-delay sequential transmission of Markov sources over burst erasure channels, providing bounds and exact characterizations for different source types and recovery scenarios.
Contribution
It introduces bounds and exact solutions for the rate-recovery function in zero-delay transmission of Markov sources over burst erasure channels, extending understanding of optimal coding strategies.
Findings
Bounds on the rate-recovery function for discrete sources are established.
Bounds coincide in the high resolution limit for Gauss-Markov sources.
The rate-recovery function is fully characterized for i.i.d. Gaussian sources.
Abstract
A setup involving zero-delay sequential transmission of a vector Markov source over a burst erasure channel is studied. A sequence of source vectors is compressed in a causal fashion at the encoder, and the resulting output is transmitted over a burst erasure channel. The destination is required to reconstruct each source vector with zero-delay, but those source sequences that are observed either during the burst erasure, or in the interval of length following the burst erasure need not be reconstructed. The minimum achievable compression rate is called the rate-recovery function. We assume that each source vector is sampled i.i.d. across the spatial dimension and from a stationary, first-order Markov process across the temporal dimension. For discrete sources the case of lossless recovery is considered, and upper and lower bounds on the rate-recovery function are established.…
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.
