Block and sliding-block source coding
- 1 March 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (2) , 211-215
- https://doi.org/10.1109/tit.1977.1055694
Abstract
A new form of source coding subject to a fidelity criterion, called sliding-block coding, has recently been introduced by Gray, Neuhoff, and Ornstein. A method of conversion from block coding to sliding-block coding, or vice versa, with an arbitrarily small increase in rate is shown for ergodic sources. The ergodic theorem is used to convert from sliding-block codes to block codes. A theorem similar to one of Rohlin is used to convert from block codes to sliding-block codes. A proof of this theorem and some discussion of the nonergodic case appear in the appendices.Keywords
This publication has 8 references indexed in Scilit:
- The Distortion-Rate Function for Nonergodic SourcesThe Annals of Probability, 1978
- Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterionIEEE Transactions on Information Theory, 1977
- Sliding-block joint source/noisy-channel coding theoremsIEEE Transactions on Information Theory, 1976
- Process definitions of distortion-rate functions and source coding theoremsIEEE Transactions on Information Theory, 1975
- Sliding-block source codingIEEE Transactions on Information Theory, 1975
- Nonblock Source Coding with a Fidelity CriterionThe Annals of Probability, 1975
- Source coding theorems without the ergodic assumptionIEEE Transactions on Information Theory, 1974
- An Application of Ergodic Theory to Probability TheoryThe Annals of Probability, 1973