Name
Abstract | ||
|---|---|---|
Given a file T, and the Huffman encoding of its elements, we present a data structure that enables direct access to the i-th element of T by reordering the bits of the compressed file and using some additional space. When compared to a Wavelet tree for Huffman Codes, our different reordering of the bits requires less additional storage overhead by reducing the need for auxiliary rank structures, while improving processing time for extracting the ith element of T. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/DCC.2015.65 | DCC |
Keywords | DocType | ISSN |
Skeleton tree,Huffman code,Wavelet tree | Conference | 1068-0314 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josh Herzberg | 1 | 0 | 0.34 |
| Shmuel T. Klein | 2 | 434 | 77.80 |
| Dana Shapira | 3 | 144 | 32.15 |