Enhanced extraction from huffman encoded files

Shmuel T. Klein, Dana Shapira

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

1 Scopus citations


Given a file T, and the Huffman encoding of its elements, we suggest using a pruning technique for Wavelet trees 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 traditional Wavelet tree for Huffman Codes, our different reordering of the bits usually requires less additional storage overhead by reducing the need for auxiliary rank structures, while improving processing time for extracting the i-th element of T.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2015, PSC 2015
EditorsJan Zd'arek, Jan Holub
Number of pages11
ISBN (Electronic)9788001057872
StatePublished - 2015
Event19th Prague Stringology Conference, PSC 2015 - Prague, Czech Republic
Duration: 24 Aug 201526 Aug 2015

Publication series

NameProceedings of the Prague Stringology Conference 2015, PSC 2015


Conference19th Prague Stringology Conference, PSC 2015
Country/TerritoryCzech Republic


Dive into the research topics of 'Enhanced extraction from huffman encoded files'. Together they form a unique fingerprint.

Cite this