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

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

On Efficient Decoding of Huffman Codes
Yakov Nekritch
[Download PostScript] [Download PDF]

Two new algorithms for space- and time- efficient decoding of minimum redundancy codes with numerical sequence property are investigated. Both algorithms are particularly efficient in case of large source alphabets and limited memory resources. Practical experiments show a reduction of up to 50 \% and more in the number of operations.

Last Change: 08/18/99 at 13:00:38
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope