Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme

Details Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme

2002-05-18

arxiv.org/abs/cs/0205048v2

Computer Science

Data Structures and Algorithms

Scientific paper

We give a polynomial-time approximation scheme for the generalization of
Huffman Coding in which codeword letters have non-uniform costs (as in Morse
code, where the dash is twice as long as the dot). The algorithm computes a
(1+epsilon)-approximate solution in time O(n + f(epsilon) log^3 n), where n is
the input size.

Affiliated with

Also associated with

No associations

Rating

Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme 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 Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599191