Bidirectional adaptive compression

Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


A new dynamic Huffman encoding has been proposed recently (Shmuel et al., 2021), which instead of basing itself on the information gathered from the already processed portion of the file, as traditional adaptive codings do, uses rather the information that is still to come. The current work extends this idea to bidirectional adaptive compression, taking both past and future into account, and not only performs at least as good as static Huffman, but also provably improves on the future-only based variant. We extend the technique to arithmetic coding and give both theoretical and empirical results that support the enhancement of the new compression algorithm.

Original languageEnglish
Pages (from-to)40-50
Number of pages11
JournalDiscrete Applied Mathematics
StatePublished - 15 May 2023


  • Adaptive compression
  • Arithmetic code
  • Huffman code


Dive into the research topics of 'Bidirectional adaptive compression'. Together they form a unique fingerprint.

Cite this