Fixed-rate universal codes for Markov sources
- 1 May 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (3) , 360-367
- https://doi.org/10.1109/tit.1978.1055881
Abstract
The existence of a fixed-rate block source code whose performance for each source in a class of Markov sources is uniformly close to the distortion-rate function of that source is investigated. Such a code is called strong universal. It is found that strong universal codes of all rates exist for the class of all binary first-order Markov sources. But for a larger alphabet or for the class of allnth-order Markov sources withn > 2, there is a critical rateR\astsuch that strong universal codes exist for rates greater than or equal toR\ast, but not for rates less thanR\ast.Keywords
This publication has 6 references indexed in Scilit:
- The Distortion-Rate Function for Nonergodic SourcesThe Annals of Probability, 1978
- Block and sliding-block source codingIEEE Transactions on Information Theory, 1977
- Fixed rate universal block source coding with a fidelity criterionIEEE Transactions on Information Theory, 1975
- A Generalization of Ornstein's $\bar d$ Distance with Applications to Information TheoryThe Annals of Probability, 1975
- Source coding theorems without the ergodic assumptionIEEE Transactions on Information Theory, 1974
- Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterionIEEE Transactions on Information Theory, 1972