Entropy approximation in lossy source coding problem

DOI10.3390/E17053400zbMATH Open1338.94053OpenAlexW1485153201WikidataQ112225933 ScholiaQ112225933MaRDI QIDQ296333FDOQ296333

Authors: Marek Śmieja, Jacek Tabor 

Publication date: 15 June 2016

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/e17053400

Mathematics Subject Classification ID

Source coding (94A29)

Cites Work

• A Mathematical Theory of Communication
• Quantization
• The minimum-entropy set cover problem
• Tight results on minimum entropy set cover
• On the dimension and entropy of probability distributions
• A survey of the theory of source coding with a fidelity criterion
• Lossy source coding
• Weighted approach to general entropy function
• Entropy of the Mixture of Sources and Entropy Dimension
• Epsilon Entropy of Stochastic Processes
• Epsilon Entropy and Data Compression
• Source coding with escort distributions and Rényi entropy bounds

Cited In (1)

• Constrained clustering with a complex cluster structure

This page was built for publication: Entropy approximation in lossy source coding problem

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