Pairs of words with nonmaterializable mutual information

MaRDI QIDQ1582931zbMATH OpenFDO

Authors Andrei Romashchenko

Publication date 20 November 2003

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

zbMATH Keywords

Kolmogorov complexitymutual information

Mathematics Subject Classification ID

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

Recommendations

• On common information
• A Random Oracle Does Not Help Extract the Mutual Information
• On joint conditional complexity (entropy)
• Proofs of conservation inequalities for Levin's notion of mutual information of 1974
• An operational characterization of mutual information in algorithmic information theory

Cited in

(8)

• On common information
• Clustering with respect to the information distance
• A Random Oracle Does Not Help Extract the Mutual Information
• Characterizing Pure High-Order Entanglements in Lexical Semantic Spaces via Information Geometry
• An operational characterization of mutual information in algorithmic information theory
• Communication complexity of the secret key agreement in algorithmic information theory
• Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
• Communication complexity of the secret key agreement in algorithmic information theory

This page was built for publication: Pairs of words with nonmaterializable mutual information

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