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.
Original language | English |
---|---|
Title of host publication | Proceedings - DCC 2015 |
Subtitle of host publication | 2015 Data Compression Conference |
Editors | Ali Bilgin, Michael W. Marcellin, Joan Serra-Sagrista, James A. Storer |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 447 |
Number of pages | 1 |
ISBN (Electronic) | 9781479984305 |
DOIs | |
State | Published - 2 Jul 2015 |
Event | 2015 Data Compression Conference, DCC 2015 - Snowbird, United States Duration: 7 Apr 2015 → 9 Apr 2015 |
Publication series
Name | Data Compression Conference Proceedings |
---|---|
Volume | 2015-July |
ISSN (Print) | 1068-0314 |
Conference
Conference | 2015 Data Compression Conference, DCC 2015 |
---|---|
Country/Territory | United States |
City | Snowbird |
Period | 7/04/15 → 9/04/15 |
Bibliographical note
Publisher Copyright:© 2015 IEEE.
Keywords
- Huffman code
- Skeleton tree
- Wavelet tree