Journal of the ACM
Paper

Linear Algorithm for Data Compression via String Matching

Download paper

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.

View all publications