Decoding of canonical Huffman codes with look-up tables

Summary form only given. This paper presents an efficient algorithm for decoding canonical Huffman codes with lookup tables. Canonical codes are a subclass of Huffman codes, that have a numerical sequence property, i.e., codewords with the same length are binary representations of consecutive integers. In the case of decoding with look-up tables we read a number of bits at each step of the decoding process. We look up the value of the read bit sequence in a table and if this bit sequence contains a codeword, we output the corresponding symbol. Otherwise we proceed with the decoding, using the next look-up table or using some other method.