A direct proof of the coding theorem for discrete sources with memory
- 1 May 1975
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 21 (3) , 310-317
- https://doi.org/10.1109/tit.1975.1055376
Abstract
In this paper we provide an alternate method of proving the existence theorem for the coding of discrete stationary ergodic sources subject to a fidelity constraint. This method differs from previously published proofs for sources with memory in that a random coding argument is obtained directly for the coding of sourcen-tuples. The main advantage of the technique employed in this paper is that it can easily be extended to yield the basis for the proof of the coding theorem for more general sources (e.g., nonergodic) and for sources with unknown parameters.This publication has 7 references indexed in Scilit:
- Variable rate coding for nonergodic sources and classes of ergodic sources subject to a fidelity constraintIEEE Transactions on Information Theory, 1976
- 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
- Rate distortion theory for sources with abstract alphabets and memoryInformation and Control, 1968
- Measure TheoryPublished by Springer Nature ,1950