Liya Fan, Fa Zhang, et al.
JPDC
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
Miao Guo, Yong Tao Pei, et al.
WCITS 2011
Gosia Lazuka, Andreea Simona Anghel, et al.
SC 2024
Amy Lin, Sujit Roy, et al.
AGU 2024