On the redundancy of the fixed-database Lempel-Ziv algorithm for phi -mixing sources

@article{Yang1997OnTR,
  title={On the redundancy of the fixed-database Lempel-Ziv algorithm for phi -mixing sources},
  author={En-Hui Yang and John C. Kieffer},
  journal={IEEE Trans. Information Theory},
  year={1997},
  volume={43},
  pages={1101-1111}
}
The redundancy problem of the fixed-database Lempel–Ziv algorithm is considered. It is demonstrated that for a class of -mixing sources which includes Markov sources, unifilar sources, and finite-state sources as special cases, the redundancy of the fixed-database Lempel–Ziv algorithm with database sizen is lower-bounded by H(log log n)= log n+O((log log log n)= log n) and upper-bounded by 2H(log log n)= log n+O((log log log n)= log n) where H is the entropy rate of the source. The method of… CONTINUE READING

From This Paper

Topics from this paper.
11 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Variable-length to variable-length encoders are asymptotically mean stationary

  • J. C. Kieffer, J. G. Dunham
  • Proc. 18th Allerton Conf. on Communication…
  • 1980
Highly Influential
14 Excerpts

The redundancy and distribution of phrase lengths of the FDLZ algorithm

  • A. J. Wyner
  • Proc. 1994 IEEE Int. Symp. on Information Theory…
  • 1994
1 Excerpt

Chaitin complexity, Shannon information content of a single event and infinite random sequences (I)

  • E.-H. Yang, S. Shen
  • Sci. in China (Ser. A) , vol. 34, pp. 1183–1193…
  • 1991

The performance of universal encoding

  • V. K. Trofimov
  • IEEE Trans . Inform . Theory
  • 1991

Similar Papers

Loading similar papers…