Improved redundancy of a version of the Lempel-Ziv algorithm

Authors:
A. D. Wyner;A. J. Wyner
Affiliations:
AT&T Bell Labs., Murray Hill, NJ;-
Venue:
IEEE Transactions on Information Theory
Year:
1995

Citing 0
Cited 4

Self-Organizing Dynamic Graphs

Neural Processing Letters
Dynamic Topology Networks for Colour Image Compression

IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Bio-inspired Applications of Connectionism-Part II
Redundancy estimates for the Lempel-Ziv algorithm of data compression

Discrete Applied Mathematics
Information theoretic approaches to whole genome phylogenies

RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology

Quantified Score

Hi-index	754.84

Visualization

Abstract

The Lempel-Ziv data compression algorithm has the property that for finite-memory sources the redundancy ρ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 ρn=O (1/log n)