Information Distance in Multiples
From MaRDI portal
Publication:5281003
DOI10.1109/TIT.2011.2110130zbMATH Open1366.94209WikidataQ54086578 ScholiaQ54086578MaRDI QIDQ5281003FDOQ5281003
Authors: Paul M. B. Vitányi
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Pattern recognition, speech recognition (68T10) Measures of information, entropy (94A17) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cited In (9)
- Properties of distance spaces with power triangle inequalities
- Correct estimate of information distance
- Exploring programmable self-assembly in non-DNA based molecular computing
- Randomness, computation and mathematics
- The Average Amount of Information Lost in Multiplication
- Multi-argument distances
- Using ideas of Kolmogorov complexity for studying biological texts
- Similarity and denoising
- Differential privacy in probabilistic systems
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)