Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression

Theorems concerning the entropy of a stationary ergodic information source are derived and used to obtain insight into the workings of certain data-compression coding schemes, in particular the Lempel-Siv data compression algorithm.<
>