January 1, 1989IEEE Transactions on Information Theory

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

View Full Paper

Ask AI

Bookmark

Abstract

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Wyner et al. (1989) studied this question.

synapsesocial.com/papers/6a0eb56cb7cc3b883f22a791 https://doi.org/10.1109/18.45281

View Full Paper

Ask AI

Bookmark

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

Abstract

Discussion

Cite This Study

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

Abstract

Discussion

Cite This Study

Also Consider

Also Consider