. Anderson, Extreme value theory for a class of discrete distributions with applications to some stochastic processes, Journal of Applied Probability, vol.20, issue.01, pp.99-113, 1970.
DOI : 10.2307/1968974

A. Barron, J. Rissanen, and B. Yu, The minimum description length principle in coding and modeling, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2743-2760, 1998.
DOI : 10.1109/18.720554

N. Bingham, C. Goldie, and J. Teugels, Regular variation, 1989.
DOI : 10.1017/CBO9780511721434

D. Bontemps, Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes, IEEE Transactions on Information Theory, vol.57, issue.3, pp.1466-1478, 2011.
DOI : 10.1109/TIT.2010.2103831
URL : https://hal.archives-ouvertes.fr/hal-00284638

S. Boucheron, A. Garivier, and E. Gassiat, Coding on Countably Infinite Alphabets, IEEE Transactions on Information Theory, vol.55, issue.1, pp.358-373, 2009.
DOI : 10.1109/TIT.2008.2008150
URL : https://hal.archives-ouvertes.fr/hal-00121892

O. Catoni, Statistical learning theory and stochastic optimization, volume 1851 of Lecture Notes in Mathematics, 2004.

B. Clarke and A. Barron, Jeffreys' prior is asymptotically least favorable under entropy risk, Journal of Statistical Planning and Inference, vol.41, issue.1, pp.37-60, 1994.
DOI : 10.1016/0378-3758(94)90153-8

A. Cohen, R. Devore, G. Kerkyacharian, and D. Picard, Maximal Spaces with Given Rate of Convergence for Thresholding Algorithms, Applied and Computational Harmonic Analysis, vol.11, issue.2, pp.167-191, 2001.
DOI : 10.1006/acha.2000.0333

T. Cover and J. Thomas, Elements of information theory, 1991.

L. De-haan and A. Fereira, Extreme value theory, 2006.
DOI : 10.1007/0-387-34471-3

P. Elias, Universal codeword sets and representations of the integers, IEEE Transactions on Information Theory, vol.21, issue.2, pp.194-203, 1975.
DOI : 10.1109/TIT.1975.1055349

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

A. Garivier, Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes, IEEE Transactions on Information Theory, vol.52, issue.12, pp.5579-5586, 2006.
DOI : 10.1109/TIT.2006.885484

L. Györfi, I. Pali, and E. Van-der-meulen, On Universal Noiseless Source Coding for Infinite Source Alphabets, European Transactions on Telecommunications, vol.34, issue.1, pp.125-132, 1993.
DOI : 10.1002/ett.4460040207

L. Györfi, I. Páli, and E. C. Van-der-meulen, There is no Universal Source Code for Infinite Alphabet, Proceedings. IEEE International Symposium on Information Theory, pp.267-271, 1994.
DOI : 10.1109/ISIT.1993.748370

D. Haussler and M. Opper, Mutual information, metric entropy and cumulative relative entropy risk, The Annals of Statistics, vol.25, issue.6, pp.2451-2492, 1997.
DOI : 10.1214/aos/1030741081
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.6916

G. Kerkyacharian and D. Picard, Minimax or maxisets? Bernoulli, pp.219-253, 2002.