Compression of Low Entropy Strings with Lempel--Ziv Algorithms

DOI10.1137/S0097539797331105zbMath0941.68055OpenAlexW2150056094MaRDI QIDQ4943851

Giovanni Manzini, S. Rao Kosaraju

Publication date: 19 March 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797331105

zbMATH Keywords

data compressionempirical entropyLempel-Ziv parsing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20)

Related Items (20)

Indexing text using the Ziv--Lempel trie ⋮ On compressing and indexing repetitive sequences ⋮ A new class of string transformations for compressed text indexing ⋮ Practical Wavelet Tree Construction ⋮ Stronger Lempel-Ziv based compressed text indexing ⋮ On optimally partitioning a text to improve its compression ⋮ Lempel-Ziv-like parsing in small space ⋮ Dictionary-symbolwise flexible parsing ⋮ A sensor-based framework for kinetic data compression ⋮ Compressing table data with column dependency ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Unnamed Item ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ Range majorities and minorities in arrays ⋮ On the Value of Multiple Read/Write Streams for Data Compression ⋮ Compressed Multiple Pattern Matching ⋮ Bicriteria Data Compression ⋮ Random Access to High-Order Entropy Compressed Text ⋮ Linked dynamic tries with applications to LZ-compression in sublinear time and space

This page was built for publication: Compression of Low Entropy Strings with Lempel--Ziv Algorithms