Sorry, you need to enable JavaScript to visit this website.

Compressing the Tree of Canonical Huffman Coding

Citation Author(s):
Submitted by:
Qi Cheng
Last updated:
28 February 2022 - 9:06pm
Document Type:
Poster
Document Year:
2022
Event:
Categories:
 
up
0 users have voted:

Comments

I think that your proposed encoding is basically based on LOUDS (level order unary degree sequence) built on full binary trees, leveraging the fact that the leaves can be omitted since each internal node has always two children. I therefore wonder whether using compressed bit vectors like RRR built upon a LOUDS representation (omitting the leaves) would achieve even better compression ratios.