The Lempel-Ziv data compression algorithm has the property that for finite-memory sources the redundancy /spl rho//sub n/ (defined as the difference between the average code rate and the entropy when the memory size is n) is O (log log n/log n). We suggest a new version of the algorithm with redundancy /spl rho//sub n/=O (1/log n).>
No takes yet. Share an insight, caveat, or question.
Wyner et al. (1995) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: