Prefix Codes: Equiprobable Words, Unequal Letter Costs
classification
💻 cs.DS
keywords
codingcostshuffmanletterunequalalgorithmcodecodes
read the original 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).]
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.