Backward Weighted Coding

Extending recently suggested methods, a new dynamic compression algorithm is proposed, which assigns larger weights to characters that have just been coded by means of an increasing weight function. Empirical results present its efficient compression performance, which, for input files with locally...

Full description

Saved in:
Bibliographic Details
Published in:DCC (Los Alamitos, Calif.) pp. 93 - 102
Main Authors: Fruchtman, Aharon, Gross, Yoav, Klein, Shmuel T., Shapira, Dana
Format: Conference Proceeding
Language:English
Published: IEEE 01.03.2021
Subjects:
Arithmetic Coding
Compression algorithms
Data compression
Encoding
Entropy
Heuristic algorithms
Huffman Coding
Static and Dynamic Coding
ISSN:2375-0359
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Extending recently suggested methods, a new dynamic compression algorithm is proposed, which assigns larger weights to characters that have just been coded by means of an increasing weight function. Empirical results present its efficient compression performance, which, for input files with locally skewed distributions, can improve beyond the lower bound given by the entropy for static encoding, at the price of slower running times for compression, and comparable time for decompression.
ISSN:2375-0359
DOI:10.1109/DCC50243.2021.00017