Abstract
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 language | English |
---|---|
Title of host publication | Proceedings of the Prague Stringology Conference, PSC 2019 |
Editors | Jan Holub, Jan Zdarek |
Publisher | Prague Stringology Club |
Pages | 92-101 |
Number of pages | 10 |
ISBN (Electronic) | 9788001066188 |
State | Published - 2019 |
Event | 23rd Prague Stringology Conference, PSC 2019 - Prague, Czech Republic Duration: 26 Aug 2019 → 28 Aug 2019 |
Publication series
Name | Proceedings of the Prague Stringology Conference, PSC 2019 |
---|
Conference
Conference | 23rd Prague Stringology Conference, PSC 2019 |
---|---|
Country/Territory | Czech Republic |
City | Prague |
Period | 26/08/19 → 28/08/19 |
Bibliographical note
Publisher Copyright:© Proceedings of the Prague Stringology Conference, PSC 2019. All rights reserved.