A space efficient direct access data structure

DOI10.1016/J.JDA.2016.12.001zbMath1407.68106OpenAlexW2559763914MaRDI QIDQ2397148

Shmuel T. Klein, Dana Shapira, Gilad Baruch

Publication date: 29 May 2017

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2016.12.001

zbMATH Keywords

wavelet treesdirect accessrank/select data structuresskeleton Huffman tree

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (6)

Optimal Skeleton Huffman Trees Revisited ⋮ Bidirectional adaptive compression ⋮ Optimal skeleton and reduced Huffman trees ⋮ Optimal Skeleton Huffman Trees ⋮ Forward looking Huffman coding ⋮ Accelerated partial decoding in wavelet trees

Cites Work

• Unnamed Item
• Unnamed Item
• Random access to Fibonacci encoded files
• A simple storage scheme for strings achieving entropy bounds
• Robust universal complete codes for transmission and compression
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Alphabet Partitioning for Compressed Rank/Select and Applications
• Universal codeword sets and representations of the integers
• Jewels of Stringology
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Practical Entropy-Compressed Rank/Select Dictionary

This page was built for publication: A space efficient direct access data structure