A criterion for extractability of mutual information for a triple of strings

DOI10.1023/A:1023690701161zbMath1077.94008OpenAlexW103623114MaRDI QIDQ2487083

Andrei Romashchenko

Publication date: 17 August 2005

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023690701161

zbMATH Keywords

mutual informationinformationKolmogorov complexitybinary stringextraction of mutual information

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items (2)

Clustering with respect to the information distance ⋮ Kolmogorov Complexity as a Language

This page was built for publication: A criterion for extractability of mutual information for a triple of strings