Conditional Information Inequalities for Entropic and Almost Entropic Points

Abstract

We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be extended to any unconditional linear inequalities. Some of these conditional inequalities hold for almost entropic points, while others do not. We also discuss some counterparts of conditional information inequalities for Kolmogorov complexity.

Submitted to the IEEE Transactions on Information Theory

References in corpus (1)

• Conditional and unconditional information inequalities: an algebraic example

Cited by in corpus (8)

• Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication
• Integrity Constraints Revisited: From Exact to Approximate Implication
• Partition-Symmetrical Entropy Functions
• The geometry of Gaussian double Markovian distributions
• Conditional independence structures over four discrete random variables revisited: conditional Ingleton inequalities
• Self-adhesivity in lattices of abstract conditional independence models
• Conditional Information Inequalities and Combinatorial Applications
• No eleventh conditional Ingleton inequality