Prefix Codes: Equiprobable Words, Unequal Letter Costs
<|reference_start|>Prefix Codes: Equiprobable Words, Unequal Letter Costs: 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).]<|reference_end|>
@article{golin2002prefix,
    title={Prefix Codes: Equiprobable Words, Unequal Letter Costs},
    author={Mordecai Golin, Neal E. Young},
    journal={SIAM J. Computing 25(6):1281-1304 (1996)},
    year={2002},
    doi={10.1137/S0097539794268388},
    archivePrefix={arXiv},
    eprint={cs/0205049},
    primaryClass={cs.DS}
}