Partition-Symmetrical Entropy Functions

From MaRDI portal



Abstract: Let calN=1,cdots,n. The entropy function of a set of n discrete random variables Xi:iincalN is a 2n-dimensional vector whose entries are , the (joint) entropies of the subsets of the set of n random variables with H(Xemptyset)=0 by convention. The set of all entropy functions for n discrete random variables, denoted by Gamman∗, is called the entropy function region for n. Characterization of Gamman∗ and its closure overlineGamman∗ 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 p=calN1,cdots,calNt be a t-partition of calN. An entropy function is called p-symmetrical if for all calA,calBsubsetcalN, whenever |calAcapcalNi|=|calBcapcalNi|, i=1,cdots,t. The set of all the p-symmetrical entropy functions, denoted by Psip∗, is called p-symmetrical entropy function region. We prove that overlinePsip∗, the closure of Psip∗, is completely characterized by Shannon-type information inequalities if and only if p is the 1-partition or a 2-partition with one of its blocks being a singleton. The characterization of the partition-symmetrical entropy functions can be useful for solving some information theory and related problems where symmetry exists in the structure of the problems. Keywords: entropy, entropy function, information inequality, polymatroid.













This page was built for publication: Partition-Symmetrical Entropy Functions

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