Tales of Huffman
Information Theory
2007-07-13 v1 Computational Complexity
math.IT
Abstract
We study the new problem of Huffman-like codes subject to individual restrictions on the code-word lengths of a subset of the source words. These are prefix codes with minimal expected code-word length for a random source where additionally the code-word lengths of a subset of the source words is prescribed, possibly differently for every such source word. Based on a structural analysis of properties of optimal solutions, we construct an efficient dynamic programming algorithm for this problem, and for an integer programming problem that may be of independent interest.
Keywords
Cite
@article{arxiv.cs/0612133,
title = {Tales of Huffman},
author = {Paul M. B. Vitanyi and Zvi Lotker},
journal= {arXiv preprint arXiv:cs/0612133},
year = {2007}
}
Comments
LaTex 8 pages