Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Entropy approximation in lossy source coding problem

From MaRDI portal
Publication:296333
Jump to:navigation, search

DOI10.3390/e17053400zbMath1338.94053OpenAlexW1485153201WikidataQ112225933 ScholiaQ112225933MaRDI QIDQ296333

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)


Related Items

Constrained clustering with a complex cluster structure



Cites Work

  • A Mathematical Theory of Communication
  • Source coding with escort distributions and Rényi entropy bounds
  • Tight results on minimum entropy set cover
  • The minimum-entropy set cover problem
  • On the dimension and entropy of probability distributions
  • A survey of the theory of source coding with a fidelity criterion
  • Quantization
  • 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
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:296333&oldid=12179040"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki