Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
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
Dzung Phan, Vinicius Lima
INFORMS 2023
R. Sebastian, M. Weise, et al.
ECPPM 2022
Conference paper
Program equivalence and context-free grammars
Barry K. Rosen
SWAT 1972