Fixed-rate universal lossy source coding and rates of convergence for memoryless sources
- 1 May 1995
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (3) , 665-676
- https://doi.org/10.1109/18.382013
Abstract
A fixed-rate universal lossy coding scheme is introduced for independent and identically distributed (i.i.d.) sources, It is shown for finite alphabet sources and arbitrary single letter distortion measures that as the sample size n grows the expected distortion obtained using this universal scheme converges to Shannon's distortion rate function D(R) at a rate O (log n/n). The scheme can be extended to universal quantization of real i.i.d sources subject to a squared error criterion, It is shown in this case that the per-letter distortion converges to D(R) at a rate O(root log n/n) both in expectation and almost surely for any real-valued bounded i.i.d. source.Keywords
This publication has 21 references indexed in Scilit:
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source codingIEEE Transactions on Information Theory, 1994
- Universal redundancy rates do not existIEEE Transactions on Information Theory, 1993
- On the method of bounded differencesPublished by Cambridge University Press (CUP) ,1989
- Stochastic Complexity and ModelingThe Annals of Statistics, 1986
- The performance of universal encodingIEEE Transactions on Information Theory, 1981
- Fixed rate universal block source coding with a fidelity criterionIEEE Transactions on Information Theory, 1975
- Error exponent for source coding with a fidelity criterionIEEE Transactions on Information Theory, 1974
- Enumerative source encodingIEEE Transactions on Information Theory, 1973
- The Transmission Distortion of a Source as a Function of the Encoding Block Length*Bell System Technical Journal, 1968
- Sequence time coding for data compressionProceedings of the IEEE, 1966