neal young / Golin96Prefix

  • publication/Golin96Prefix.png 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].
    Journal version of [1994].

© Copyrights are reserved by the publishers.
Download for personal and limited academic use only.