Algorithmic relative complexity

DOI10.3390/e13040902zbMath1229.68046OpenAlexW2095699593MaRDI QIDQ657564

Daniele Cerra, Mihai Datcu

Publication date: 9 January 2012

Published in: Entropy (Search for Journal in Brave)

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

zbMATH Keywords

relative entropyKolmogorov complexitycompressionKullback-Leibler divergencesimilarity measurecompression based distance

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) Measures of information, entropy (94A17)

Related Items (2)

Complementarity of information obtained by Kolmogorov and Aksentijevic-Gibson complexities in the analysis of binary time series ⋮ Expanding the algorithmic information theory frame for applications to Earth observation

Cites Work

• A Mathematical Theory of Communication
• Shared Information and Program Plagiarism Detection
• Clustering by Compression
• The Similarity Metric
• A measure of relative entropy between individual sequences with application to universal classification
• Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity
• Three approaches to the quantitative definition of information^*
• On the Length of Programs for Computing Finite Binary Sequences
• A formal theory of inductive inference. Part I
• On Information and Sufficiency
• An introduction to Kolmogorov complexity and its applications
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic relative complexity