Title :
Sandwich bounds for joint entropy
Author :
Madiman, M. ; Tetali, P.
Author_Institution :
Yale Univ. New Haven, New Haven
Abstract :
New upper and lower bounds are given for joint entropy of a collection of random variables, in both discrete and continuous settings. These bounds generalize well-known information theoretic inequalities due to Han. A number of applications are suggested, including a new bound on the number of independent sets of a graph that is of interest in discrete mathematics, and a bound on the number of zero-error codes.
Keywords :
entropy codes; graph theory; random processes; set theory; discrete mathematics; graph theory; information theoretic inequality; joint entropy; random variable; sandwich bound; set theory; zero-error codes; Combinatorial mathematics; Density measurement; Educational institutions; Entropy; Probability density function; Prototypes; Random variables; Statistics; Upper bound;
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
DOI :
10.1109/ISIT.2007.4557276
