Partition-Symmetrical Entropy Functions
Qi Chen, Raymond W. Yeung

TL;DR
This paper characterizes the set of partition-symmetrical entropy functions, showing they are fully described by Shannon-type inequalities only in specific partition cases, which aids in solving symmetric information theory problems.
Contribution
It provides a complete characterization of the closure of partition-symmetrical entropy functions using Shannon-type inequalities for certain partitions, advancing understanding of entropy regions.
Findings
Closure of p-symmetrical entropy functions is characterized by Shannon inequalities for 1- and certain 2-partitions.
The result simplifies the analysis of entropy regions with symmetry.
It offers potential applications in symmetric information theory problems.
Abstract
Let . The entropy function of a set of discrete random variables is a -dimensional vector whose entries are , the (joint) entropies of the subsets of the set of random variables with by convention. The set of all entropy functions for discrete random variables, denoted by , is called the entropy function region for . Characterization of and its closure are well-known open problems in information theory. They are important not only because they play key roles in information theory problems but also they are related to other subjects in mathematics and physics. In this paper, we consider \emph{partition-symmetrical entropy functions}. Let be a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
