Abstract
The compression efficiency of canonical Huffman coding is drastically affected by the size of the compression window, the choice of which is typically done heuristically analytic bounds for the worst-case compression efficiency of canonical Huffman coding are introduced, as a function of the size of the compression window. The derived bounds offer fine-grained control over the compression latency-efficiency trade-off.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
