next up previous
Next: About this document Up: Reflections on ``Universal Prediction Previous: Some Afterthoughts

References

1
C. E. Shannon, ``Prediction and Entropy of Printed English,'' Bell Sys. Tech. Jour., Vol. 30, pp. 51--64, 1951.

2
J. Ziv and A. Lempel, ``Compression of Individual Sequences via Variable Rate Coding,'' IEEE Trans. Information Theory, Vol. IT-24, pp. 530--536, Sept. 1978.

3
M. Feder, ``Gambling Using a Finite State Machine,'' IEEE Trans. Information Theory, Vol. IT-37, pp. 1459--1465, Sept. 1991.

4
J. L. Kelly Jr, ``A New Interpretation of Information Rate,'' Bell Sys. Tech. Jour., Vol. 35, pp. 917--926, 1956.

5
T. M. Cover. ``Universal Gambling Schemes and the Complexity Measures of Kolmogorov and Chaitin,'' Technical Report No. 12, Dept. of Statistics, Stanford University, October, 1974.

6
P. H. Algoet, ``The Strong Law of Large Numbers for Sequential Decision Under Uncertainty,'' submitted for publication to the IEEE Trans. Information Theory.

7
T. M. Cover, ``Behavior of Sequential Predictors of Binary Sequences,'' in Proc. of the 4th Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, 1965, pages 263--272.

8
J. F. Hannan, ``Approximation to Bayes Risk in Repeated Plays,'' in Contributions to the Theory of Games, Vol. III, Annals of Mathematics Studies, number 39, pages 97--139, Princeton, 1957.

9
D. Blackwell, `` Controlled Random Walk,'' in Proceedings of the 1954 International Congress of Mathematicians, volume III, pages 336--338, Amsterdam, North Holland.

10
N. Merhav and M. Feder, ``Universal Schemes for Sequential Decision from Individual Data Sequences,'' IEEE Trans. Information Theory, Vol. IT-39, pp.1280-1292, July 1993.

11
G. G. Langdon. ``A Note on the Lempel-Ziv Model for Compressing Individual Sequences,'' IEEE Trans. Information Theory, Vol. IT-29, pp. 284--287, March 1983.

12
J. Rissanen, ``A Universal Data Compression System,'' IEEE Trans. Information Theory, IT-29, pp. 656--664, Sept. 1983.

13
T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley, New York, 1991.

14
M. Feder and N. Merhav, ``Relations between entropy and error probability,'' IEEE Trans. Information Theory, to appear, Jan. 1994.

15
J. S. Vitter, ``Optimal Prefetching via Data Compression,'' in Proceedings of Foundation of Computer Science (FOCS) Conf., pp. 121--130, 1991.



Ramesh Rao
Tue Aug 8 11:36:42 PDT 1995