Synchronizing dynamic huffman codes

Shmuel T. Klein, Elina Opalinsky, Dana Shapira

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

3 Scopus citations


Traditional dynamic Huffman algorithms update the frequencies adaptively after every character, according to the assumption that better compression can be achieved when all previous characters are taken into account, justifying the slow processing time. This, however, turns the encoded file into an extremely vulnerable one in the case of even a single bit error. Since the above mentioned assumption is not necessarily true, we explore blockwise dynamic Huffman variants, where the Huffman tree is periodically, rather than constantly, updated. Experiments show that avoiding the updates at every character and choosing larger blocks does not hurt the compression performance, and may even improve it at times. Moreover, the new scheme seems to be more robust against single errors introduced in the encoded file.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference, PSC 2018
EditorsJan Holub, Jan Zdarek
Number of pages11
ISBN (Electronic)9788001064849
StatePublished - 2018
Event22nd Prague Stringology Conference, PSC 2018 - Prague, Czech Republic
Duration: 27 Aug 201828 Aug 2018

Publication series

NameProceedings of the Prague Stringology Conference, PSC 2018


Conference22nd Prague Stringology Conference, PSC 2018
Country/TerritoryCzech Republic


Dive into the research topics of 'Synchronizing dynamic huffman codes'. Together they form a unique fingerprint.

Cite this