A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss

DOI10.1109/TIT.2017.2700860MaRDI QIDQ4566622zbMATH OpenFDO

Authors Yanina Y. Shkel, Sergio Verdú

Publication date 27 June 2018

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Recommendations

• Multiterminal Source Coding Under Logarithmic Loss
• The Likelihood Encoder for Lossy Compression
• Learning Theory
• Lossy codes and a new variant of the learning-with-errors problem
• Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
• Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case
• scientific article; zbMATH DE number 1811356
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• Nonasymptotic Noisy Lossy Source Coding
• Lossless and near-lossless source coding for multiple access networks

Cited in

(1)

• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources

This page was built for publication: A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss

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