Backward Weighted Coding

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationProceedings - DCC 2021
Subtitle of host publication2021 Data Compression Conference
EditorsAli Bilgin, Michael W. Marcellin, Joan Serra-Sagrista, James A. Storer
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages10
ISBN (Electronic)9780738112275
StatePublished - Mar 2021
Event2021 Data Compression Conference, DCC 2021 - Snowbird, United States
Duration: 23 Mar 202126 Mar 2021

Publication series

NameData Compression Conference Proceedings


Conference2021 Data Compression Conference, DCC 2021
Country/TerritoryUnited States


  • Arithmetic Coding
  • Huffman Coding
  • Static and Dynamic Coding

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications


Dive into the research topics of 'Backward Weighted Coding'. Together they form a unique fingerprint.

Cite this