A simple storage scheme for strings achieving entropy bounds
type: Item
instance of: scholarly article
title: A simple storage scheme for strings achieving entropy bounds
zbMATH Open document ID: 1110.68029
author: Paolo Ferragina
author: Rossano Venturini
published in: Theoretical Computer Science
publication date: 2007-03-15T00:00:00Z
full work available at URL: TR-06-09.pdf.gz
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 5134106
zbMATH Keywords: data structures for strings
zbMATH Keywords: data compression
MaRDI profile type: Publication
OpenAlex ID: W4240576586
cites work: Q2934653
cites work: Boosting textual compression in optimal linear time
cites work: Indexing compressed text
cites work: Optimal Lower Bounds for Rank and Select Indexes
cites work: Q4471381
cites work: Q2934640
cites work: An analysis of the Burrows—Wheeler transform
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: New text indexing functionalities of the compressed suffix arrays
cites work: Squeezing succinct data structures into entropy bounds
cites work: Q4833659
cites work: Compression of individual sequences via variable-rate coding
DOI: 10.1016/J.TCS.2006.12.012
Recommended article: Q2934654
Recommended article: Compression of Low Entropy Strings with Lempel--Ziv Algorithms
Recommended article: On the complexity of random strings
Recommended article: Succinct Randomized Encodings and their Applications
Recommended article: An upper bound on the entropy of run-length coding (Corresp.)
Recommended article: Simple Compression Code Supporting Random Access and Fast String Matching
Recommended article: Random Access to High-Order Entropy Compressed Text
Recommended article: Limits on the computational power of random strings
Recommended article: Limits on the Computational Power of Random Strings
description: scientific article; zbMATH DE number 5134106