Tales of Huffman

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 pr...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Vitanyi, Paul M B, Lotker, Zvi
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 25.12.2006
Subjects
Algorithms
Dynamic programming
Integer programming
Structural analysis
Online AccessGet full text
ISSN2331-8422

Cover

More Information
Summary: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.
Bibliography:content type line 50
SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
ISSN:2331-8422