A fast decoding method for prefix codes
Ruy Luiz Milidiú, Eduardo Sany Laber, L.O. Moreno, J.C. Duarte · 2003
Summary form only given. Prefix codes allow text to be decoded without ambiguity, since this code is a variable-length type where no codeword is a prefix of the other. The problem of improving the decoding speed has received special attention in the data compression community. A scheme that employs length-restricted codes to generate the codewords and table look-up is proposed. In order to reduce the bit manipulation, lexical expansion is introduced to decode more than one symbol in a single decoding step.