Random access to high-order entropy compressed text

DOI10.1007/978-3-642-40273-9_14zbMATH Open1394.68135OpenAlexW158959260MaRDI QIDQ2848976FDOQ2848976

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Block graphs in practice
• A simple storage scheme for strings achieving entropy bounds
• Title not available (Why is that?)
• 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)