Data compression with long repeated strings
From MaRDI portal
Recommendations
Cites work
- A Space-Economical Suffix Tree Construction Algorithm
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Data compression via textual substitution
- Efficient randomized pattern-matching algorithms
- scientific article; zbMATH DE number 432779 (Why is no real title available?)
- scientific article; zbMATH DE number 1149447 (Why is no real title available?)
Cited in
(9)- On the distribution function of the complexity of finite sequences
- Sending compressed messages to a learned receiver on a bidirectional line.
- Similarity based deduplication with small data chunks
- scientific article; zbMATH DE number 4045113 (Why is no real title available?)
- Compression with the tudocomp framework
- Dynamic Compressed Strings with Random Access
- The macro model for data compression (extended abstract)
- Compression in the presence of shared data
- On optimally partitioning a text to improve its compression
This page was built for publication: Data compression with long repeated strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5944433)