On Algorithmic Rate-Distortion Function

We develop rate-distortion theory in the Kol-Mogorov complexity setting. This is a theory of lossy compression of individual data objects, using the computable regularities of the data

[1]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discret. Math..

[2]  David L. Donoho,et al.  The Kolmogorov Sampler , 2002 .

[3]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[4]  Jacob Ziv,et al.  Distortion-rate theory for individual sequences , 1980, IEEE Trans. Inf. Theory.

[5]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[6]  Naoki Saito,et al.  Simultaneous noise suppression and signal compression using a library of orthonormal bases and the minimum-description-length criterion , 1994, Defense, Security, and Sensing.

[7]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[8]  En-Hui Yang,et al.  Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function , 1993, IEEE Trans. Inf. Theory.

[9]  Balas K. Natarajan.  Filtering random noise from deterministic signals via data compression , 1995, IEEE Trans. Signal Process..

[10]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[11]  Alexandros Eleftheriadis,et al.  Complexity distortion theory , 2003, IEEE Trans. Inf. Theory.

[12]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[13]  Nikolai K. Vereshchagin,et al.  Kolmogorov Complexity with Error , 2006, STACS.

[14]  Peter Elias,et al.  Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.

[15]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[16]  Martin Vetterli,et al.  Image denoising via lossy compression and wavelet thresholding , 1997, Proceedings of International Conference on Image Processing.

[17]  Avi Wigderson,et al.  Extractors and pseudo-random generators with optimal seed length , 2000, STOC '00.

[18]  Toby Berger,et al.  Lossy Source Coding , 1998, IEEE Trans. Inf. Theory.

[19]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[20]  Nikolai K. Vereshchagin,et al.  Kolmogorov's structure functions and model selection , 2002, IEEE Transactions on Information Theory.

[21]  J. Muramatsu,et al.  Distortion-complexity and rate-distortion function , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.