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.
|Title of host publication||Proceedings of the Prague Stringology Conference 2015, PSC 2015|
|Editors||Jan Zd'arek, Jan Holub|
|Publisher||Prague Stringology Club|
|Number of pages||11|
|State||Published - 2015|
|Event||19th Prague Stringology Conference, PSC 2015 - Prague, Czech Republic|
Duration: 24 Aug 2015 → 26 Aug 2015
|Name||Proceedings of the Prague Stringology Conference 2015, PSC 2015|
|Conference||19th Prague Stringology Conference, PSC 2015|
|Period||24/08/15 → 26/08/15|
Bibliographical notePublisher Copyright:
© Czech Technical University in Prague, Czech Republic.