Information Distance in Multiples

DOI10.1109/TIT.2011.2110130MaRDI QIDQ5281003zbMATH OpenWikidataFDO

Authors Paul M. B. Vitányi

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.2011.2110130

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Pattern recognition, speech recognition (68T10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Measures of information, entropy (94A17)

Recommendations

• Information distance
• scientific article; zbMATH DE number 7650931
• INFORMATION DISTANCE AND ITS APPLICATIONS
• Information Distance and Its Applications
• A distance coefficient based on the information theory
• Exact Expression For Information Distance
• Information distance and conditional complexities

Cited in

(9)

• Using ideas of Kolmogorov complexity for studying biological texts
• Exploring programmable self-assembly in non-DNA based molecular computing
• Correct estimate of information distance
• Randomness, computation and mathematics
• Similarity and denoising
• The Average Amount of Information Lost in Multiplication
• Differential privacy in probabilistic systems
• Multi-argument distances
• Properties of distance spaces with power triangle inequalities

This page was built for publication: Information Distance in Multiples

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