| [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 ] |
| [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 ] |
| [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 ] |
| [Feder1996Hierarchical] | M. Feder and N. Merhav. Hierarchical universal coding. IEEE Trans. Inform. Theory, 42(5):1354-1364, Sep 1996. [ 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 ] |
| [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.