High-order entropy compressed bit vectors with rank/select

DOI10.3390/A7040608zbMath1461.68074OpenAlexW2028963209MaRDI QIDQ1736624

Kai Beskers, Johannes Fischer

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a7040608

zbMATH Keywords

data compressiondesign and analysis of algorithmsimplementation and testing of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) 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
• Unnamed Item
• Ultra-succinct representation of ordered trees with applications
• Efficient fully-compressed sequence representations
• A note on sequence prediction over large alphabets
• An analysis of the Burrows—Wheeler transform
• 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: High-order entropy compressed bit vectors with rank/select