Enhanced Direct Access to Huffman Encoded Files

Josh Herzberg, Shmuel T. Klein, Dana Shapira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationProceedings - DCC 2015
Subtitle of host publication2015 Data Compression Conference
EditorsAli Bilgin, Michael W. Marcellin, Joan Serra-Sagrista, James A. Storer
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)9781479984305
StatePublished - 2 Jul 2015
Event2015 Data Compression Conference, DCC 2015 - Snowbird, United States
Duration: 7 Apr 20159 Apr 2015

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


Conference2015 Data Compression Conference, DCC 2015
Country/TerritoryUnited States


  • Huffman code
  • Skeleton tree
  • Wavelet tree


Dive into the research topics of 'Enhanced Direct Access to Huffman Encoded Files'. Together they form a unique fingerprint.

Cite this