A Recurrence Theorem for Dependent Processes with Applications to Data Compression.

In an earlier paper Wyner and Ziv proved theorems on recurrence times for strings in a random sequence, and applied these theorems to data compression and the Lempel-Ziv algorithm. In this note, we give a proof that one of these theorems holds under an essentially weaker hypothesis, and give a proof which is considerably simpler than the original.