Accelerated partial decoding in wavelet trees

DOI10.1016/j.dam.2018.07.016zbMath1434.68121OpenAlexW2888684922WikidataQ129402230 ScholiaQ129402230MaRDI QIDQ2295619

Gilad Baruch, Shmuel T. Klein, Dana Shapira

Publication date: 14 February 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.016

zbMATH Keywords

wavelet treedirect accessrange decoding

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Random access to Fibonacci encoded files
• A simple storage scheme for strings achieving entropy bounds
• A space efficient direct access data structure
• Alphabet Partitioning for Compressed Rank/Select and Applications
• Basic Concepts in Data Structures
• Fast Pattern Matching in Strings
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Practical Entropy-Compressed Rank/Select Dictionary
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

This page was built for publication: Accelerated partial decoding in wavelet trees