Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings - DCC 2021 |
Subtitle of host publication | 2021 Data Compression Conference |
Editors | Ali Bilgin, Michael W. Marcellin, Joan Serra-Sagrista, James A. Storer |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 93-102 |
Number of pages | 10 |
ISBN (Electronic) | 9780738112275 |
DOIs | |
State | Published - Mar 2021 |
Event | 2021 Data Compression Conference, DCC 2021 - Snowbird, United States Duration: 23 Mar 2021 → 26 Mar 2021 |
Publication series
Name | Data Compression Conference Proceedings |
---|---|
Volume | 2021-March |
ISSN (Print) | 1068-0314 |
Conference
Conference | 2021 Data Compression Conference, DCC 2021 |
---|---|
Country/Territory | United States |
City | Snowbird |
Period | 23/03/21 → 26/03/21 |
Bibliographical note
Publisher Copyright:© 2021 IEEE.
Keywords
- Arithmetic Coding
- Huffman Coding
- Static and Dynamic Coding