Tales of Huffman

Simple item page
dc.creatorVitanyi, Paul M. B.
dc.creatorLotker, Zvi
dc.date2006-12-25
dc.date.accessioned2026-07-07T08:16:53Z
dc.date.available2026-07-07T08:16:53Z
dc.descriptionWe 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.
dc.descriptionLaTex 8 pages
dc.identifierhttps://arxiv.org/abs/cs/0612133
dc.identifierhttp://arxiv.org/abs/cs/0612133
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133944
dc.subjectInformation Theory
dc.subjectComputational Complexity
dc.titleTales of Huffman
dc.typetext

Files

Collections

arXiv