Random access to high-order entropy compressed text

DOI10.1007/978-3-642-40273-9_14MaRDI QIDQ2848976zbMATH OpenOpenAlexFDO

Authors Roberto Grossi

Publication date 13 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40273-9_14

Mathematics Subject Classification ID

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

Recommendations

• Simple Random Access Compression
• scientific article; zbMATH DE number 2079421
• A simple storage scheme for strings achieving entropy bounds
• Dynamic Compressed Strings with Random Access
• Simple Compression Code Supporting Random Access and Fast String Matching

Cites work

• scientific article; zbMATH DE number 756768 (Why is no real title available?)
• A linear lower bound on index size for text retrieval
• A quick tour on suffix arrays and compressed suffix arrays
• A simple storage scheme for strings achieving entropy bounds
• Algorithmics on SLP-compressed strings: a survey
• An analysis of the Burrows-Wheeler transform
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• CRAM: compressed random access memory
• Cell-probe lower bounds for succinct partial sums
• Changing base without losing space
• Compressed representations of sequences and full-text indexes
• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• Compression of individual sequences via variable-rate coding
• Compression, indexing, and retrieval for massive string data
• Data structure lower bounds on random access to grammar-compressed strings
• Dynamic Compressed Strings with Random Access
• Fast compressed tries through path decompositions
• Optimal lower bounds for rank and select indexes
• Random access to grammar-compressed strings and trees
• Robust universal complete codes for transmission and compression
• Simple Random Access Compression
• Squeezing succinct data structures into entropy bounds
• Statistical Encoding of Succinct Data Structures
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Succinct indexes for strings, binary relations and multilabeled trees
• Succinct representations of ordinal trees
• The Smallest Grammar Problem
• The cell probe complexity of succinct data structures

Cited in

(4)

• Block graphs in practice
• A simple storage scheme for strings achieving entropy bounds
• scientific article; zbMATH DE number 1794209 (Why is no real title available?)
• Simple Random Access Compression

This page was built for publication: Random access to high-order entropy compressed text

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