The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees (Q4268846)
From MaRDI portal
scientific article; zbMATH DE number 1354487
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees |
scientific article; zbMATH DE number 1354487 |
Statements
The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees (English)
0 references
28 October 1999
0 references
Huffman coding
0 references
adaptive coding
0 references
prefix codes
0 references
enumeration of trees
0 references
lattices
0 references
combinatorial optimization
0 references
convexity
0 references
submodular functions
0 references
entropy
0 references
tree imbalance
0 references
Schur convex functions
0 references
majorization
0 references
Moebius inversion
0 references
combinatorial inequalities
0 references
Fortuin-Kasteleyn-Ginibre (FKG) inequality
0 references
quadrangle inequality
0 references
Monge matrices
0 references
dynamic programming
0 references
greedy algorithms
0 references
