Rate of convergence result for a universal D-semifaithful code

IEEE Transactions on Information Theory

Volumn 39, Issue 3, 1993, Pages 813-820

  Yu, Bin ^a   Speed, T P ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; RANDOM PROCESSES; SIGNAL DISTORTION;

MEMORYLESS SOURCES; RANDOM CODING; RATE-DISTORTION THEORY; UNIVERSAL CODING;

CODES (SYMBOLS);

EID: 0027596996     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.256490     Document Type: Article

References (28)

1. A. R. Barron T. M. Cover Minimum complexity density estimation IEEE Trans. Inform. Theory 37 1034 1054 July 1991
2. T. Berger Rate Distortion Theory: A Mathematical Basis for Data Compression 1971 Prentice-Hall NH, Englewood Cliffs
3. T. Berger L. D. Davisson Advances in Source Coding 1975 Springer-Verlag New York
4. R. E. Blahut Principles and Practice of Information Theory 1978 Addison-Wesley MA, Reading
5. B. S. Clarke A. R. Barron Information theoretic asymptotics of Bayes methods IEEE Trans. Inform. Theory 36 453 471 May 1990
6. I. Csiszár J. Korner Information Theory: Coding Theorems for Discrete Memoryless Systems 1981 Academic New York
7. T. M. Cover J. A. Thomas Lecture Notes 1990 Stanford Univ. CA Elements of information theory
8. L. D. Davisson Minimax noiseless universal coding for Markov sources IEEE Trans. Inform. Theory IT-29 211 215 1983
9. L. Gerencser J. Rissanen A prediction bound for Gaussian ARMA processes Proc. 25th CDC 3 1487 1490 Proc. 25th CDC Athens Greece 1986
10. E. J. Hannan L. Kavalieris Regression, autoregressive models J. Time Series Anal. 7 27 49 1986
11. E. M. Hemerly M. H. A. Davis Strong consistency of the predictive least squares criterion for order determination of autoregiessive processes Ann. Statist. 17 941 946 1989
12. J. Kieffer A unified approach to weak universal source coding IEEE Trans. Inform. Theory IT-24 674 682 1978
13. K. M. Mackenthun M. B. Pursley Variable-rate universal block source coding subject to a fidelity constraint IEEE Trans. Inform. Theory IT-24 349 360 1978
14. D. L. Neuhoff R. M. Gray L. D. Davisson Fixed rate universal block source coding with a fidelity criterion IEEE Trans. Inform. Theory IT-21 511 523 1975
15. D. S. Ornstein P. C. Shields Universal almost sure data compression Ann. Probab. 18 441 452 1990
16. R. J. Pilc Coding theorems for discrete source-channel pairs 1967 MA, Cambridge
17. R. J. Pilc The transmission distortion of a source as a function of the encoding block length Bell Syst. Tech. J. 47 827 885 1968
18. D. Pollard Convergence of Stochastic Processes 1984 Springer-Verlag New York
19. J. Rissanen Stochastic complexity and modeling Ann. Statist. 14 1080 1100 1986
20. J. Rissanen Complexity of strings in the class of Markov sources IEEE Trans. Inform. Theory IT-34 526 532 July 1986
21. J. Rissanen T. P. Speed B. Yu Density estimation by stochastic complexity IEEE Trans. Inform. Theory 38 315 323 Mar. 1992
22. P. Shields Universal almost sure data compression using Markov types Probl. Contr. Inform. Theory 19 269 277 1990
23. C. Shannon W. Weaver A Mathematical Theory of Communication 1949 Univ. Illinois Press IL, Urbana
24. C. Shannon Information and Decision Processes 1959 McGraw-Hill New York Coding theorems for a discrete source with a fidelity criterion
25. C. Shannon R. G. Gallager Lower bounds to error probability for coding on discrete memoryless channels I Inform. Contr. 10 65 103 1969
26. C. Shannon R. G. Gallager Lower bounds to error probability for coding on discrete memoryless channels II Inform. Contr. 10 523 552 1969
27. M. J. Weinberger A. Lempel J. Ziv A sequential algorithm for the universal coding of finite memory sources IEEE Trans. Inform Theory 38 1002 1014 May 1992
28. B. Yu T. Speed Data compression and histograms Probability Theory Related Fields 92 195 229 1992