Data compression with long repeated strings

DOI10.1016/S0020-0255(01)00097-4zbMath1031.68535OpenAlexW2053003009MaRDI QIDQ5944433

M. Douglas McIlroy, Jon Louis Bentley

Publication date: 10 October 2001

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00097-4

zbMATH Keywords

Lempel-Ziv schemes

Mathematics Subject Classification ID

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

Related Items (4)

Similarity based deduplication with small data chunks ⋮ On optimally partitioning a text to improve its compression ⋮ On the distribution function of the complexity of finite sequences ⋮ Sending compressed messages to a learned receiver on a bidirectional line.

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient randomized pattern-matching algorithms
• Data compression via textual substitution
• A Space-Economical Suffix Tree Construction Algorithm
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding

This page was built for publication: Data compression with long repeated strings