DMCA
Sub-linear Decoding of Huffman Codes Almost In-Place (1998)
| Citations: | 1 - 0 self |
BibTeX
@TECHREPORT{Brodnik98sub-lineardecoding,
author = {Andrej Brodnik and Svante Carlsson},
title = {Sub-linear Decoding of Huffman Codes Almost In-Place},
institution = {},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a succinct data structure storing the Huffman encoding that permits sublinear decoding in the number of transmitted bits. The size of the extra storage except for the storage of the symbols in the alphabet for the new data structure is O(l log N) bits, where l is the longest Huffman code and N is the number of symbols in the alphabet. We present a solution that typically decodes texts of sizes ranging from a few hundreds up to 68 000 with only one third to one fifth of the number of memory accesses of that of regular Huffman implementations. In our solution, the overhead structure where we do all but one memory access to, is never more than 342 bytes. This will with a very high probability reside in cache, which means that the actual decoding time compares even better. 1 Introduction If you have an alphabet of N symbols that you would like to encode the typical solution would be to use dlog ne bits to encode N different numbers, each number corresponding to a symbol. This ...
Keyphrases
sub-linear decoding huffman code almost in-place memory access regular huffman implementation huffman code succinct data structure actual decoding time overhead structure typical solution new data structure high probability reside different number transmitted bit extra storage dlog ne bit
