Average entropy functions

Authors:
Qi Chen;Chen He;Lingge Jiang;Qingchuan Wang
Affiliations:
Dept. of Electronic Eng., Shanghai Jiao Tong Univ., Shanghai, China;Dept. of Electronic Eng., Shanghai Jiao Tong Univ., Shanghai, China;Dept. of Electronic Eng., Shanghai Jiao Tong Univ., Shanghai, China;Dept. of Electronic Eng., Shanghai Jiao Tong Univ., Shanghai, China
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 4
Cited 0

A framework for linear information inequalities

IEEE Transactions on Information Theory
A non-Shannon-type conditional inequality of information quantities

IEEE Transactions on Information Theory
On characterization of entropy function via information inequalities

IEEE Transactions on Information Theory
Dualities Between Entropy Functions and Network Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The closure of the set of entropy functions associated with n discrete variables, Γn*, is a convex cone in (2n - 1)- dimensional space, but its full characterization remains an open problem. In this paper, we map Γn* to an n-dimensional region Φn* by averaging the joint entropies with the same number of variables, and show that the simpler Φn* can be characterized solely by the Shannon-type information inequalities.