Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes
From MaRDI portal
Abstract: The optimal zero delay coding of a finite state Markov source is considered. The existence and structure of optimal codes are studied using a stochastic control formulation. Prior results in the literature established the optimality of deterministic Markov (Walrand-Varaiya type) coding policies for finite time horizon problem, and the optimality of both deterministic nonstationary and randomized stationary policies for the infinite time horizon problem. Our main result here shows that for any irreducible and aperiodic Markov source with a finite alphabet, emph{deterministic and stationary} Markov coding policies are optimal for the infinite horizon problem. In addition, the finite blocklength (time horizon) performance on an optimal (stationary and Markov) coding policy is shown to approach the infinite time horizon optimum at a rate . The results are extended to systems where zero delay communication takes place across a noisy channel with noiseless feedback.
Cited in
(5)- On asymptotically optimal methods of prediction and adaptive coding for Markov sources
- Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels
- scientific article; zbMATH DE number 5941301 (Why is no real title available?)
- The Minimum Average Code for Finite Memoryless Monotone Sources
- Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes
This page was built for publication: Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589420)
