Typical sequences and all that: entropy, pattern matching, and data compression
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The author applies pattern matching results to three problems in information theory. The characterisation of a probability law is also discussed.Keywords
This publication has 3 references indexed in Scilit:
- Classification with finite memoryIEEE Transactions on Information Theory, 1996
- The sliding-window Lempel-Ziv algorithm is asymptotically optimalProceedings of the IEEE, 1994
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compressionIEEE Transactions on Information Theory, 1989