Computer Science – Information Theory
Scientific paper
2009-04-13
Computer Science
Information Theory
accepted by ISIT2009
Scientific paper
The closure of the set of entropy functions associated with n discrete variables, Gammar*n, is a convex cone in (2n-1)- dimensional space, but its full characterization remains an open problem. In this paper, we map Gammar*n to an n-dimensional region Phi*n by averaging the joint entropies with the same number of variables, and show that the simpler Phi*n can be characterized solely by the Shannon-type information inequalities
Chen Qi
He Chen
Jiang Lingge
Wang Qingchuan
No associations
LandOfFree
Average Entropy Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Average Entropy Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average Entropy Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-323970