Huffman Coding with Non-Sorted Frequencies

Shmuel T. Klein, Dana Shapira

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


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
Pages (from-to)171-178
Number of pages8
JournalMathematics in Computer Science
Issue number2
StatePublished - Jun 2011
Externally publishedYes


  • Burrows-Wheler transform
  • Data compression
  • Dynamic compression
  • Huffman coding
  • Partial sorting


Dive into the research topics of 'Huffman Coding with Non-Sorted Frequencies'. Together they form a unique fingerprint.

Cite this