information-theory references

[Davisson1973Universal] L. Davisson. Universal noiseless coding. IEEE Trans. Inform. Theory, 19(6):783- 795, Nov 1973. [ bib | .pdf | Abstract ]
[Kieffer1978unified] J. Kieffer. A unified approach to weak universal source coding. IEEE Trans. Inform. Theory, 24(6):674-682, Nov 1978. [ bib | .pdf | Abstract ]
[Rissanen1981Universal] J. Rissanen and G. Jr. Langdon. Universal modeling and coding. IEEE Trans. Inform. Theory, 27(1):12-23, Jan 1981. [ bib | .pdf ]
[Krichevsky1981performance] R. Krichevsky and V. Trofimov. The performance of universal encoding. IEEE Trans. Inform. Theory, 27(2):199-207, Mar 1981. [ bib | .pdf | Abstract ]
[Rissanen1984Universal] J. Rissanen. Universal coding, information, prediction, and estimation. IEEE Trans. Inform. Theory, 30(4):629-636, Jul 1984. [ bib | .pdf | Abstract ]
[Feder1986Maximum] M. Feder. Maximum entropy as a special case of the minimum description length criterion. IEEE Trans. Inform. Theory, 32(6):847 - 849, Nov 1986. [ bib | .pdf | Abstract ]
[Devroye1988Automatic] L. Devroye. Automatic pattern recognition: a study of the probability of error. IEEE Trans. Pattern Anal. Mach. Intell., 10(4):530-543, Jul 1988. [ bib | .pdf | Abstract ]
[Barron1988bound] A.R. Barron and T.M. Cover. A bound on the financial value of information. IEEE Trans. Inform. Theory, 34(5):1097-1100, Sep 1988. [ bib | .pdf | Abstract ]
[Wyner1989Some] A.D. Wyner and J. Ziv. Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression. IEEE Trans. Inform. Theory, 35(6):1250-1258, Nov 1989. [ bib | .pdf | Abstract ]
[Clarke1990Information-theoretic] B.S. Clarke and A.R. Barron. Information-theoretic asymptotics of Bayes methods. IEEE Trans. Inform. Theory, 36(3):453-471, May 1990. [ bib | .pdf | Abstract ]
[Barron1991Minimum] A.R. Barron and T.M. Cover. Minimum complexity density estimation. IEEE Trans. Inform. Theory, 37(4):1034-1054, Jul 1991. [ bib | .pdf | Abstract ]
[Tjalkens1992universal] T.J. Tjalkens and F.M.J. Willems. A universal variable-to-fixed length source code based on Lawrence's algorithm. IEEE Trans. Inform. Theory, 38(2):247-253, Mar 1992. [ bib | .pdf | Abstract ]
[Rissanen1992Density] J. Rissanen, T. P. Speed, and B. Yu. Density estimation by stochastic complexity. IEEE Trans. Inform. Theory, 38(2):315-323, Mar 1992. [ bib | .pdf | Abstract ]
[Feder1992Universal] M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Trans. Inform. Theory, 38(4):1258-1270, Jul 1992. [ bib | .pdf | Abstract ]
[Shields1993Universal] P.C. Shields. Universal redundancy rates do not exist. IEEE Trans. Inform. Theory, 39(2):520-524, Mar 1993. [ bib | .pdf | Abstract ]
[Ornstein1993Entropy] D.S. Ornstein and B. Weiss. Entropy and data compression schemes. IEEE Trans. Inform. Theory, 39(1):78-83, Jan 1993. [ bib | .pdf | Abstract ]
[Merhav1993Universal] N. Merhav and M. Feder. Universal schemes for sequential decision from individual data sequences. IEEE Trans. Inform. Theory, 39(4):1280-1292, Jul 1993. [ bib | .pdf | Abstract ]
[Merhav1993Some] N. Merhav, M. Feder, and M. Gutman. Some properties of sequential predictors for binary Markov sources. IEEE Trans. Inform. Theory, 39(3):887-892, May 1993. [ bib | .pdf | Abstract ]
[Barron1993Universal] A.R. Barron. Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. Inform. Theory, 39(3):930-945, May 1993. [ bib | .pdf | Abstract ]
[Weinberger1994Optimal] M. J. Weinberger, N. Merhav, and M. Feder. Optimal sequential probability assignment for individual sequences. IEEE Trans. Inform. Theory, 40(2):384-396, Mar 1994. [ bib | .pdf | Abstract ]
[Gyorfi1994There] L. Gyorfi, I. Pali, and E.C. Van der Meulen. There is no universal source code for an infinite source alphabet. IEEE Trans. Inform. Theory, 40(1):267-271, Jan 1994. [ bib | .pdf | Abstract ]
[Feder1994Relations] M. Feder and N. Merhav. Relations between entropy and error probability. IEEE Trans. Inform. Theory, 40(1):259 - 266, Jan 1994. [ bib | .pdf | Abstract ]
[Clarke1994Jeffreys] B. S. Clarke and A. R. Barron. Jeffreys' prior is asymptotically least favorable under entropy risk. J. Stat. Plann. Infer., 31(1):37-60, 1994. [ bib | DOI | http | .pdf | Abstract ]
[Algoet1994strong] P.H. Algoet. The strong law of large numbers for sequential decisions under uncertainty. IEEE Trans. Inform. Theory, 40(3):609-633, May 1994. [ bib | DOI | http | .pdf | Abstract ]
[Weinberger1995universal] M. J. Weinberger, J. J. Rissanen, and M. Feder. A universal finite memory source. IEEE Trans. Inform. Theory, 41(3):643-652, May 1995. [ bib | .pdf | Abstract ]
[Merhav1995strong] N. Merhav and M. Feder. A strong version of the redundancy-capacity theorem of universal. IEEE Trans. Inform. Theory, 41(3):714-722, May 1995. [ bib | .pdf | Abstract ]
[Lugosi1995Nonparametric] G. Lugosi and K. Zeger. Nonparametric estimation via empirical risk minimization. IEEE Trans. Inform. Theory, 41(3):677-687, May 1995. [ bib | .pdf | Abstract ]
[Yu1996Lower] B. Yu. Lower bounds on expected redundancy for nonparametric classes. IEEE Trans. Inform. Theory, 42(1):272-275, Jan 1996. [ bib | DOI | http | .pdf | Abstract ]
[Rissanen1996Fisher] J. J. Rissanen. Fisher information and stochastic complexity. IEEE Trans. Inform. Theory, 42(1):40-47, Jan 1996. [ bib | .pdf | Abstract ]
[Modha1996Minimum] D.S. Modha and E. Masry. Minimum complexity regression estimation with weakly dependent observations. IEEE Trans. Inform. Theory, 42(6):2133-2145, Nov 1996. [ bib | DOI | http | .pdf | Abstract ]
[Lugosi1996Concept] G. Lugosi and K. Zeger. Concept learning using complexity regularization. IEEE Trans. Inform. Theory, 42(1):48-54, Jan 1996. [ bib | .pdf | Abstract ]
[Feder1996Hierarchical] M. Feder and N. Merhav. Hierarchical universal coding. IEEE Trans. Inform. Theory, 42(5):1354-1364, Sep 1996. [ bib | .pdf | Abstract ]
[Cover1996Universal] T.M. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Trans. Inform. Theory, 42(2):348-363, Mar 1996. [ bib | .pdf | Abstract ]
[Xie1997Minimax] Q. Xie and A.R. Barron. Minimax redundancy for the class of memoryless sources. IEEE Trans. Inform. Theory, 43(2):646-657, Mar 1997. [ bib | .pdf | Abstract ]
[Morvai1997Weakly] G. Morvai, S.J. Yakowitz, and P. Algoet. Weakly convergent nonparametric forecasting of stationary time series. IEEE Trans. Inform. Theory, 43(2):483-498, Mar 1997. [ bib | .pdf | Abstract ]
[Hershkovits1997On] Y. Hershkovits and J. Ziv. On fixed-database universal data compression with limited memory. IEEE Trans. Inform. Theory, 43(6):1966-1976, Nov 1997. [ bib | .pdf | Abstract ]
[Modha1998Memory-universal] D.S. Modha and E. Masry. Memory-universal prediction of stationary random processes. IEEE Trans. Inform. Theory, 44(1):117-133, Jan 1998. [ bib | .pdf | Abstract ]
[Krichevskiy1998Laplace's] R. E. Krichevskiy. Laplace's law of succession and universal encoding. IEEE Trans. Inform. Theory, 44(1):296-303, Jan 1998. [ bib | .pdf ]
[Feder1998Universal] M. Feder and A.C. Singer. Universal data compression and linear prediction. Data Compression Conference, 1998. [ bib | .pdf | Abstract ]
[Barron1998minimum] A. Barron, J. Rissanen, and Bin Yu. The minimum description length principle in coding and modeling. IEEE Trans. Inform. Theory, 44(6):2743-2760, Oct 1998. [ bib | .pdf | Abstract ]
[Gyorfi1999simple] L. Gyorfi, G. Lugosi, and G. Morvai. A simple randomized algorithm for sequential prediction of ergodic time series. IEEE Trans. Inform. Theory, 47(5):2642 - 2650, Nov 1999. [ bib | .pdf | Abstract ]
[Xie2000Asymptotic] Q. Xie and A.R. Barron. Asymptotic minimax regret for data compression, gambling, and prediction. IEEE Trans. Inform. Theory, 46(2):431 - 445, Mar 2000. [ bib | .pdf | Abstract ]
[Shulman2004Uniform] N. Shulman and M. Feder. The Uniform Distribution as a Universal Prior. IEEE Trans. Inform. Theory, 50(6):1356 - 1362, Jun 2004. [ bib | .pdf | Abstract ]
[Meron2004Finite-memory] E. Meron and M. Feder. Finite-memory universal prediction of individual sequences. IEEE Trans. Inform. Theory, 50(7):1506-1523, Jul 2004. [ bib | .pdf | Abstract ]

This file was generated by bibtex2html 1.97.