Bidirectional adaptive compression

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

doi:10.1016/j.dam.2023.01.004

Bidirectional adaptive compression

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

Ariel University, Bar-Ilan University

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	40-50
Number of pages	11
Journal	Discrete Applied Mathematics
Volume	330
DOIs	https://doi.org/10.1016/j.dam.2023.01.004
State	Published - 15 May 2023

Keywords

Adaptive compression
Arithmetic code
Huffman code

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2023.01.004

Cite this

@article{f8bc34b19c9a4daabf30104f50b244ec,

title = "Bidirectional adaptive compression",

abstract = "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.",

keywords = "Adaptive compression, Arithmetic code, Huffman code",

author = "Aharon Fruchtman and Yoav Gross and Klein, {Shmuel T.} and Dana Shapira",

note = "Publisher Copyright: {\textcopyright} 2023",

year = "2023",

month = may,

day = "15",

doi = "10.1016/j.dam.2023.01.004",

language = "الإنجليزيّة",

volume = "330",

pages = "40--50",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Bidirectional adaptive compression

AU - Fruchtman, Aharon

AU - Gross, Yoav

AU - Klein, Shmuel T.

AU - Shapira, Dana

PY - 2023/5/15

Y1 - 2023/5/15

N2 - 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.

AB - 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.

KW - Adaptive compression

KW - Arithmetic code

KW - Huffman code

UR - http://www.scopus.com/inward/record.url?scp=85146055766&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2023.01.004

DO - 10.1016/j.dam.2023.01.004

M3 - مقالة

SN - 0166-218X

VL - 330

SP - 40

EP - 50

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Bidirectional adaptive compression

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this