TY - GEN
T1 - Bidirectional adaptive compression
AU - Fruchtman, Aharon
AU - Klein, Shmuel T.
AU - Shapira, Dana
N1 - Publisher Copyright:
© Proceedings of the Prague Stringology Conference, PSC 2019. All rights reserved.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85086069903&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85086069903
T3 - Proceedings of the Prague Stringology Conference, PSC 2019
SP - 92
EP - 101
BT - Proceedings of the Prague Stringology Conference, PSC 2019
A2 - Holub, Jan
A2 - Zdarek, Jan
T2 - 23rd Prague Stringology Conference, PSC 2019
Y2 - 26 August 2019 through 28 August 2019
ER -