Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity

DOI10.1109/TIT.2010.2048491MaRDI QIDQ5281412zbMATH OpenFDO

Authors Paul M. B. Vitányi, Nikolai K. Vereshchagin

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Rate-distortion theory in information and communication theory (94A34)

Cited in

(12)

• Dimension 1 sequences are close to randoms
• Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series
• An extended coding theorem with application to quantum complexities
• Occam bound on lowest complexity of elements
• Real patterns and indispensability
• Algorithmic statistics revisited
• Similarity and denoising
• Algorithmic statistics: forty years later
• The Rate-Distortion Risk in Estimation From Compressed Data
• Algorithmic relative complexity
• Redundancy of information: lowering effective dimension
• The Fourier ratio: a unifying measure of complexity for recovery, localization, and learning

This page was built for publication: Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity

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