Forward looking huffman coding

Shmuel Tomi Klein, Shoham Saadia, Dana Shapira

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

1 Scopus citations


Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the number of bits required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might often, but not always, be smaller. We propose here a new dynamic Huffman encoding approach, that provably always performs at least as good as static Huffman coding, and may be better than the standard dynamic Huffman coding for certain files. This is achieved by reversing the direction for the references of the encoded elements to those forming the model of the encoding, from pointing backwards to looking into the future.

Original languageEnglish
Title of host publicationComputer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings
EditorsRené van Bevern, Gregory Kucherov
Number of pages12
StatePublished - 2019
Event14th International Computer Science Symposium in Russia, CSR 2019 - Novosibirsk, Russian Federation
Duration: 1 Jul 20195 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11532 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Computer Science Symposium in Russia, CSR 2019
Country/TerritoryRussian Federation


  • Signal encoding
  • Compressed files; Dynamic Huffman coding; Forward looking; Huffman coding; Huffman encoding; Static variant
  • Encoding (symbols)


Dive into the research topics of 'Forward looking huffman coding'. Together they form a unique fingerprint.

Cite this