George Saon
SLT 2014
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
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Jehanzeb Mirza, Leonid Karlinsky, et al.
NeurIPS 2023
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence