Variable rate coding for nonergodic sources and classes of ergodic sources subject to a fidelity constraint
- 1 May 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 22 (3) , 324-337
- https://doi.org/10.1109/tit.1976.1055539
Abstract
This paper is concerned with two problems in the theory of source coding subject to a maximum average distortion constraint. The first problem involves the coding of a nonergodic discrete time source and the second involves coding for a class of ergodic discrete time sources. Coding theorems are given for both of these situations for very general source alphabets. The codes that are obtained here will, in general, be variable length codes so that average code rate and average distortion are the measures of performance.Keywords
This publication has 10 references indexed in Scilit:
- A direct proof of the coding theorem for discrete sources with memoryIEEE Transactions on Information Theory, 1975
- On the optimum average distortion attainable by fixed-rate coding of a nonergodic sourceIEEE Transactions on Information Theory, 1975
- Source coding theorems without the ergodic assumptionIEEE Transactions on Information Theory, 1974
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterionIEEE Transactions on Information Theory, 1972
- The rate distortion function for a class of sourcesInformation and Control, 1969
- PROBABILITY MEASURES IN A METRIC SPACEPublished by Elsevier ,1967
- On the category of ergodic measuresIllinois Journal of Mathematics, 1961
- On invariant probability measures IPacific Journal of Mathematics, 1960
- Ergodic setsBulletin of the American Mathematical Society, 1952