Universal Coding, Information, Prediction, and Estimation

IEEE Transactions on Information Theory

Volumn 30, Issue 4, 1984, Pages 629-636

  Rissanen, Jorma ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL FILTERING AND PREDICTION;

CODES, SYMBOLIC;

EID: 0021466584     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1984.1056936     Document Type: Article

References (18)

1. H. Akaike “A new look at the statistical model identification,” IEEE Trans. Automat. Contr., vol. AC-19, pp. 716–723, 1974.
2. J. L. Bentley and A. C. Yao “An almost optimal algorithm for unbounded searching,” Inform. Processing Letters, vol. 5, pp. 82–87, 1976.
3. L. D. Davisson “The prediction error of stationary Gaussian time series of unknown covariance,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 527–532, Oct. 1965.
4. — “Universal noiseless coding,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 783–795, Nov. 1973.
5. — “Minimax noiseless universal coding for Markov sources,” IEEE Trans. Inform. Theory, vol. IT-29, no. 2, pp. 211–215, 1983.
6. L. D. Davisson, R. J. McEliece, M. B. Pursley, and M. S. Wallace “Efficient universal noiseless source codes,” IEEE Trans. Inform. Theory, vol. IT-27, no. 3, pp. 269–279, May 1981.
7. P. Elias “Universal codeword sets and representations of the integers,” IEEE Trans. Inform. Theory, vol. IT-21, no. 2, pp. 194–203, 1975.
8. E. J. Hannan “The estimation of the order of an ARMA process,” Ann. Statist., vol. 8, no. 5, pp. 1071–1081, 1980.
9. R. E. Krichevskii and V. K. Trofimov “The performance of universal encoding,” IEEE Trans. Inform. Theory, vol. IT-27, no. 2, pp. 199–207, 1981.
10. S. K. Leung-Yan-Cheong and T. Cover “Some equivalences between Shannon entropy and Kolmogorov complexity,” IEEE Trans. Inform. Theory, vol. IT-24, no. 3, pp. 331–338, 1978.
11. L. Ljung and P. Caines “Asymptotic normality of prediction error estimators for approximate system models,” Stochastics, vol. 3, pp. 29–46, 1979.
12. R. J. McEliece, The Theory of Information and Coding. Reading, MA: Addison-Wesley, 1977.
13. J. Rissanen and G. G. Langdon, Jr. “Universal modeling and coding,” IEEE Trans. Inform. Theory, vol. IT-27, no. 1, pp. 12–23, Jan. 1981.
14. J. Rissanen “Modeling by shortest data description,” Automatica, vol. 14, pp. 465–471, 1978.
15. J. Rissanen “A universal prior for integers and estimation by minimum description length,” Ann. Statist., vol. 11, no. 2, pp. 416–431, June 1983.
16. J. Rissanen “A universal data compression system,” IEEE Trans. Inform. Theory, vol. IT-29, no. 5, pp. 656–664, Sept. 1983.
17. R. Shibata “Asymptotically efficient selection of the order of the model for estimating parameters of a linear process,” Ann. Statist., vol. 8, pp. 147–164, 1980.
18. M. Wax and J. Rissanen, “Information theoretic measures for feedback between time series,” (to appear in J. Amer. Statist. Assn.).