Huffman coding with non-sorted frequencies

Shmuel T. Klein, Dana Shapira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are investigated as to the consequences of relaxing the requirement of keeping the frequencies in order. Using only partial order may speed up the code construction, which is important in some applications, at the cost of increasing the size of the encoded file.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2008
Number of pages8
StatePublished - 2008
Externally publishedYes
EventPrague Stringology Conference 2008, PSC 2008 - Prague, Czech Republic
Duration: 1 Sep 20083 Sep 2008

Publication series

NameProceedings of the Prague Stringology Conference 2008


ConferencePrague Stringology Conference 2008, PSC 2008
Country/TerritoryCzech Republic


  • Algorithms
  • Code construction; Huffman; Huffman coding; Optimal codes; Partial order
  • Optimal systems


Dive into the research topics of 'Huffman coding with non-sorted frequencies'. Together they form a unique fingerprint.

Cite this