Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
Data Structures and Algorithms
2015-06-02 v2
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0205048,
title = {Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme},
author = {Mordecai Golin and Claire Mathieu and Neal E. Young},
journal= {arXiv preprint arXiv:cs/0205048},
year = {2015}
}