On the asymptotic behaviors of the recurrence time with fidelity criterion for discrete memoryless sources and memoryless gaussian sources

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E81-A, Issue 5, 1998, Pages 981-985

  Koga, Hiroki ^a   Arimoto, Suguru ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b RITSUMEIKAN UNIVERSITY   (Japan)

Author keywords

Fidelity criterion; Lempel ziv code; Lossy data compression; Recurrence time; Siring matching

Indexed keywords

ASYMPTOTIC STABILITY; CODES (SYMBOLS); CONVERGENCE OF NUMERICAL METHODS; PROBABILITY; RANDOM PROCESSES; SET THEORY; STATISTICAL METHODS; THEOREM PROVING;

FIDELITY CRITERION; LEMPEL-ZIV CODE; LOSSY DATA COMPRESSION; RECURRENCE TIME; STRING MATCHING;

DATA COMPRESSION;

EID: 0032068945     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inf. Theory, vol.IT-23, no.3, pp.337-343, 1977.
2. A.D. Wyner and J. Ziv, "Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression," IEEE Trans. Inf. Theory, vol.IT-35, no.6, pp.1250-1258, 1989.
3. D.S. Ornstein and B. Weiss, "Entropy and data compression schemes," IEEE Trans. Inf. Theory, vol.IT-39, no.l, pp.78-83, 1994.
4. Y. Steinberg and M. Gutman, "An algorithm for source coding subject to a fidelity criterion, based on string matching," IEEE Trans. Inf. Theory, vol.IT-39, no.3, pp.877-886, 1993.
5. H. Koga and S. Arimoto, "Asymptotic properties of a lossy data compression algorithm with common database," lEICE Technical Report, IT93-118, 1994.
6. F. Kanaya and J. Muramatsu, "An almost sure recurrence time with distortion for stationary ergodic sources," Proc. of 17th SITA, pp.517-520, 1994.
7. E. Yang and J.C. Kiefier, "On the performance of data compression algorithms based upon string matching," Preprint, 1995.
8. M. Kubo and S. Ihara, "String matching and data compression for Gaussian stationary sources," Proc. of 20th SITA, pp.825-828, 1997.
9. P.C. Shields, "The Ergordic Theory of Discrete Sample Paths," American Mathematical Society, 1996.
10. I. Csiszâr and J. Körnor, "Information Theory: Coding Theorem for Discrete Memoryless Systems," Academic Press, 1981.
11. T. Berger, "Rate Distortion Theory: A Mathematical Basis for Data Compression," Prentice-Hall, 1971.