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.
No takes yet. Share an insight, caveat, or question.
Rodeh et al. (1981) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: