Faster implementation of canonical minimum redundancy prefix codes
This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.
data structure algorithm huffman decoding compression canonical huffman tree