A lower bound on the redundancy of D-ary Huffman codes.
Jovan Dj. GolicMilorad M. ObradovicPublished in: IEEE Trans. Inf. Theory (1987)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- error correction
- objective function
- lower and upper bounds
- worst case
- information content
- sufficiently accurate
- competitive ratio
- constraint satisfaction problems
- upper and lower bounds
- lagrangian relaxation
- linear programming relaxation
- lower bounding
- error correcting
- markov random field
- data structure