Supermodularity and subadditivity properties of the entropy on the majorization lattice

IEEE Transactions on Information Theory

Volumn 48, Issue 4, 2002, Pages 933-938

  Cicalese, Ferdinando ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Entropy; Lattice; Majorization; Subadditivity; Submodularity; Supermodularity

Indexed keywords

ENTROPY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; VECTORS;

MAJORIZATION LATTICE;

INFORMATION THEORY;

EID: 0036539953     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.992785     Document Type: Article

References (26)

1. Relative uniformity of sources and the comparison of optimal code costs
2. An inequality for the weights of two families of sets, their union and intersection
3. The size of a share must be large
4. The Ahlswede-Daykin theorem
5. Correlation inequalities for some partially ordered sets
6. Polymatroidal dependence structure of a set of random variables
7. On the optimality of Huffmann trees
8. Generalized Huffmann trees
9. Submodular functions and convexity
10. Conditions for the optimality of the Huffmann algorithm
11. The construction of Huffmann codes is a submodular (convex) optimization problem over a lattice of binary trees
12. The disparity between work and entropy in cryptology
13. The lattice theory of information
14. Some aspect of convexity useful in information theory
15. On characterization of entropy function via information inequalities