How about use 2 huffman trees? One used for dictionary, and for packed data. Of course, it hurts speed.
How about use 2 huffman trees? One used for dictionary, and for packed data. Of course, it hurts speed.