Prefix Codes: Equiprobable Words, Unequal Letter Costs
Mordecai Golin, Neal E. Young

TL;DR
This paper presents a near-linear-time algorithm for a Huffman coding variant where all words have equal probability but letters have unequal costs, improving efficiency in such encoding scenarios.
Contribution
It introduces a novel, efficient algorithm for prefix coding with equal word probabilities and non-uniform letter costs, extending Huffman coding techniques.
Findings
Algorithm operates in near-linear time
Handles non-uniform letter costs effectively
Applicable to equal-probability word encoding
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).]
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
