The first-order asymptotic of waiting times with distortion between stationary processes

IEEE Transactions on Information Theory

Volumn 47, Issue 1, 2001, Pages 338-347

  Chi, Z ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

mixing; Large deviation; Relative entropy; String matching; Waiting times

Indexed keywords

ASYMPTOTIC STABILITY; DATA COMPRESSION; ENCODING (SYMBOLS); MARKOV PROCESSES; MATHEMATICAL TRANSFORMATIONS; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

FIRST ORDER ASYMPTOTIC; LARGE DEVIATION; RELATIVE ENTROPY; STRING MATCHING; WAITING TIMES;

INFORMATION THEORY;

EID: 0035089747     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.904532     Document Type: Article

References (14)

1. On the performance of data compression algorithms based upon string matching
2. The asymptotics of waiting times between stationary processes, allowing distortion
3. On the redundancy of lossy source coding with abstract alphabets
4. Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
5. Waiting times: Positive and negative results on the Wyner-Ziv problem
6. Almost-sure waiting times results for weak and very weak Bernoulli processes
7. Asymptotic properties of data compression and suffix trees
8. Asymptotic recurrence and waiting times for stationary processes
9. A suboptimal lossy data compression based on approximate pattern matching
10. On large deviations for uniformly strong mixing sequences
11. Large deviations and strong mixing
12. Basic properties of strong mixing conditions