Source coding exponents for zero-delay coding with finite memory

DOI10.1109/TIT.2002.808137MaRDI QIDQ4679941zbMATH OpenFDO

Authors Neri Merhav, Ioannis Kontoyiannis

Publication date 31 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2002.808137

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Error exponent for source coding with a fidelity criterion
• Universal Zero-Delay Joint Source–Channel Coding
• Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source
• Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
• Fixed-rate universal lossy source coding and rates of convergence for memoryless sources

Cited in

(5)

• Universal Zero-Delay Joint Source–Channel Coding
• The Minimum Average Code for Finite Memoryless Monotone Sources
• Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source
• Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
• 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: Source coding exponents for zero-delay coding with finite memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679941)