Segev Shlomov, Avi Yaeli
CHI 2024
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
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025