Alon Itai, Michael Rodeh
Information and Computation
Paper
Linear Algorithm for Data Compression via String Matching
Abstract
A linear implementation of the optimal universal data compression methods of Lempel and Ziv is described. The main tool is McCreight's algorithm for constructing suffix trees. Both bounded and unbounded memory are considered. © 1981, ACM. All rights reserved.
Related
Cristina Cornelio, Judy Goldsmith, et al.
JAIR
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Giuseppe Romano, Aakrati Jain, et al.
ECTC 2025