Condensed Table of Huffman Coding, a New Approach to Efficient Decoding

Reza Hashemian · IEEE Transactions on Communications · 2004

This letter introduces a new technique for designing and decoding Huffman codes. The key idea is to define a condensed Huffman table (CHT) that is smaller than the ordinary Huffman table and which leads to fast decoding. For example, the new approach has been shown to reduce the memory consumption by a factor of eight, compared with the single-side grown Huffman table.

Read the paper · More papers on PaperTik