Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023
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
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023