High-order entropy compressed bit vectors with rank/select

DOI10.3390/A7040608zbMATH Open1461.68074OpenAlexW2028963209MaRDI QIDQ1736624FDOQ1736624

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

Recommendations

• Practical entropy-compressed rank/select dictionary
• scientific article; zbMATH DE number 2079421
• Optimal indexes for sparse bit vectors
• Rank and select operations on a word
• Dynamic Entropy-Compressed Sequences and Full-Text Indexes

zbMATH Keywords

data compressiondesign and analysis of algorithmsimplementation and testing of algorithms

Mathematics Subject Classification ID

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

Cites Work

• An analysis of the Burrows—Wheeler transform
• Ultra-succinct representation of ordered trees with applications
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Title not available (Why is that?)
• Efficient fully-compressed sequence representations
• Practical Entropy-Compressed Rank/Select Dictionary
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on sequence prediction over large alphabets

This page was built for publication: High-order entropy compressed bit vectors with rank/select

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736624)