On common information

DOI10.1016/S0304-3975(98)00070-XMaRDI QIDQ1275006zbMATH OpenFDO

Authors Andrej Muchnik

Publication date 12 January 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(98)00070-X

zbMATH Keywords

algorithmic information theorycommon information of two wordsKolmogorov entropy

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Pairs of words with nonmaterializable mutual information
• On joint conditional complexity (entropy)
• Common randomness in information theory and cryptography. I. Secret sharing

Cites work

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3497786 (Why is no real title available?)
• On common information
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

Cited in

(10)

• On common information
• Pairs of words with nonmaterializable mutual information
• A Random Oracle Does Not Help Extract the Mutual Information
• An operational characterization of mutual information in algorithmic information theory
• Conditional and relevant common information
• Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
• Stability of properties of Kolmogorov complexity under relativization
• Algebraic barriers to halving algorithmic information quantities in correlated strings
• Communication complexity of the secret key agreement in algorithmic information theory
• Algebraic barriers to halving algorithmic information quantities in correlated strings

This page was built for publication: On common information

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