Entropy Region and Convolution

DOI10.1109/TIT.2016.2601598MaRDI QIDQ2976480zbMATH OpenOpenAlexFDO

Authors František Matúš, László Csirmaz

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.5957

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Abstract: The entropy region is constructed from vectors of random variables by collecting Shannon entropies of all subvectors. Its shape is studied here by means of polymatroidal constructions, notably by convolution. The closure of the region is decomposed into the direct sum of tight and modular parts, reducing the study to the tight part. The relative interior of the reduction belongs to the entropy region. Behavior of the decomposition under selfadhesivity is clarified. Results are specialized to and completed for the region of four random variables. This and computer experiments help to visualize approximations of a symmetrized part of the entropy region. Four-atom conjecture on the minimization of Ingleton score is refuted.

Cited in

(13)

• Inequalities for entropies and dimensions
• On typical encodings of multivariate ergodic sources.
• One-adhesive polymatroids.
• Selfadhesivity in Gaussian conditional independence structures
• Classes of matroids closed under minors and principal extensions
• Cyclic flats of a polymatroid
• Common information, matroid representation, and secret sharing for matroid ports
• On abelian and homomorphic secret sharing schemes
• Secret sharing and duality
• No Eleventh Conditional Ingleton Inequality
• Algebraic matroids are almost entropic
• Tropical probability theory and an application to the entropic cone
• Violations of the Ingleton inequality and revising the four-atom conjecture.

This page was built for publication: Entropy Region and Convolution

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