Tales of Huffman

Details Tales of Huffman Tales of Huffman

2006-12-25

arxiv.org/abs/cs/0612133v1

Computer Science

Information Theory

LaTex 8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Tales of Huffman does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tales of Huffman, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tales of Huffman will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122968