Source coding exponents for zero-delay coding with finite memory

DOI10.1109/TIT.2002.808137zbMATH Open1063.94041MaRDI QIDQ4679941FDOQ4679941

Authors: Neri Merhav, Ioannis Kontoyiannis 

Publication date: 31 May 2005

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source
• Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes
• Universal Zero-Delay Joint Source–Channel Coding
• Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
• The Minimum Average Code for Finite Memoryless Monotone Sources

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)