Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 1999 Copyright 1999 Universität Bonn, Institut für Informatik, Abt. V
85209

Decoding of Canonical Huffman Codes with Look-Up Tables
Yakov Nekritch
[Download PostScript] [Download PDF]

We describe an efficient algorithm for decoding canonical Huffman codes with look-up tables. Furthermore, a connection between the probability of a symbol and the length of its codeword in a Huffman code is investigated. We design a method for estimating probabilities of codewords in a given Huffman code. We show how this method can be used to estimate a ``good'' size for the look-up table used in the decoding.

Last Change: 07/05/01 at 14:04:36
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope