Bidirectional adaptive compression

Aharon Fruchtman, Shmuel T. Klein, Dana Shapira

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

4 Scopus citations


A new dynamic Huffman encoding has been proposed in earlier work, 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 give both theoretical and empirical results that support the enhancement of the new compression algorithm.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference, PSC 2019
EditorsJan Holub, Jan Zdarek
PublisherPrague Stringology Club
Number of pages10
ISBN (Electronic)9788001066188
StatePublished - 2019
Event23rd Prague Stringology Conference, PSC 2019 - Prague, Czech Republic
Duration: 26 Aug 201928 Aug 2019

Publication series

NameProceedings of the Prague Stringology Conference, PSC 2019


Conference23rd Prague Stringology Conference, PSC 2019
Country/TerritoryCzech Republic

Bibliographical note

Publisher Copyright:
© Proceedings of the Prague Stringology Conference, PSC 2019. All rights reserved.


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

Cite this