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.
|Title of host publication||Proceedings of the Prague Stringology Conference, PSC 2018|
|Editors||Jan Holub, Jan Zdarek|
|Publisher||Prague Stringology Club|
|Number of pages||11|
|State||Published - 2018|
|Event||22nd Prague Stringology Conference, PSC 2018 - Prague, Czech Republic|
Duration: 27 Aug 2018 → 28 Aug 2018
|Name||Proceedings of the Prague Stringology Conference, PSC 2018|
|Conference||22nd Prague Stringology Conference, PSC 2018|
|Period||27/08/18 → 28/08/18|
Bibliographical notePublisher Copyright:
© Proceedings of the Prague Stringology Conference, PSC 2018. All rights reserved.