Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity

DOI10.1109/TIT.2010.2048491zbMath1368.68225MaRDI QIDQ5281412

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)

Mathematics Subject Classification ID

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

Related Items (10)

Occam bound on lowest complexity of elements ⋮ Dimension 1 sequences are close to randoms ⋮ Similarity and denoising ⋮ Real patterns and indispensability ⋮ Algorithmic Statistics: Forty Years Later ⋮ Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series ⋮ An extended coding theorem with application to quantum complexities ⋮ Algorithmic relative complexity ⋮ Algorithmic Statistics Revisited ⋮ On algorithmic statistics for space-bounded algorithms

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