Prefix Codes: Equiprobable Words, Unequal Letter Costs
Data Structures and Algorithms
2015-06-02 v1
Abstract
Describes a near-linear-time algorithm for a variant of Huffman coding, in which the letters may have non-uniform lengths (as in Morse code), but with the restriction that each word to be encoded has equal probability. [See also ``Huffman Coding with Unequal Letter Costs'' (2002).]
Keywords
Cite
@article{arxiv.cs/0205049,
title = {Prefix Codes: Equiprobable Words, Unequal Letter Costs},
author = {Mordecai Golin and Neal E. Young},
journal= {arXiv preprint arXiv:cs/0205049},
year = {2015}
}
Comments
proceedings version in ICALP (1994)