J. Abrahams, Code and parse trees for lossless source encoding, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), pp.113-146, 2001.
DOI : 10.1109/SEQUEN.1997.666911

N. Alon and A. Orlitsky, A lower bound on the expected length of one-to-one codes, IEEE Transactions on Information Theory, vol.40, issue.5, pp.1670-1672, 1994.
DOI : 10.1109/18.333891

K. Atteson, The asymptotic redundancy of Bayes rules for Markov chains, IEEE Transactions on Information Theory, vol.45, issue.6, pp.2104-2109, 1999.
DOI : 10.1109/18.782149

R. C. Baker, Dirichlet's theorem on diophantine approximation, Mathematical Proceedings of the Cambridge Philosophical Society, vol.51, issue.01, pp.37-59, 1978.
DOI : 10.1007/BF01298826

A. Barron, Logically Smooth Density Estimation, 1985.

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

T. Berger, Rate-Distortion Theory, 1971.
DOI : 10.1002/0471219282.eot142

P. Billingsley, Convergence of Probability Measures, 1968.
DOI : 10.1002/9780470316962

P. Billingsley, Statistical Methods in Markov Chains, The Annals of Mathematical Statistics, vol.32, issue.1, pp.12-40, 1961.
DOI : 10.1214/aoms/1177705136

L. Boza, Asymptotically Optimal Tests for Finite Markov Chains, The Annals of Mathematical Statistics, vol.42, issue.6, 1971.
DOI : 10.1214/aoms/1177693067

Y. Bugeaud, M. Drmota, and W. Szpankowski, On the Construction of (Explicit) Khodak's Code and Its Analysis, IEEE Transactions on Information Theory, vol.54, issue.11, 2008.
DOI : 10.1109/TIT.2008.929959

J. W. Cassels, An Introduction to Diophantine Approximation, 1957.

B. Clarke and A. Barron, Information-theoretic asymptotics of Bayes methods, IEEE Transactions on Information Theory, vol.36, issue.3, pp.453-471, 1990.
DOI : 10.1109/18.54897

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-61, 1994.
DOI : 10.1016/0378-3758(94)90153-8

R. Corless, G. Gonnet, D. Hare, D. Jeffrey, and D. Knuth, On the LambertW function, On the Lambert W Function, pp.329-359, 1996.
DOI : 10.1007/BF02124750

I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 1981.
DOI : 10.1017/CBO9780511921889

I. Csiszàr and P. Shields, Redundancy rates for renewal and other processes, IEEE Transactions on Information Theory, vol.42, issue.6, pp.2065-2072, 1996.
DOI : 10.1109/18.556596

T. Cover and E. Ordentlich, Universal portfolios with side information, IEEE Transactions on Information Theory, vol.42, issue.2, pp.348-363, 1996.
DOI : 10.1109/18.485708
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.5541

L. Davisson, Universal noiseless coding, IEEE Transactions on Information Theory, vol.19, issue.6, pp.783-795, 1973.
DOI : 10.1109/TIT.1973.1055092

L. Davisson and A. Leon-garcia, A source matching approach to finding minimax codes, IEEE Transactions on Information Theory, vol.26, issue.2, pp.166-174, 1980.
DOI : 10.1109/TIT.1980.1056167

A. Dembo and I. Kontoyiannis, The asymptotics of waiting times between stationary processes, allowing distortion, The Annals of Applied Probability, vol.9, issue.2, pp.413-429, 1999.
DOI : 10.1214/aoap/1029962749

A. Dembo and I. Kontoyiannis, Critical behavior in lossy source coding, IEEE Transactions on Information Theory, vol.47, issue.3, pp.1230-1236, 2001.
DOI : 10.1109/18.915693

A. Dembo and I. Kontoyiannis, Source coding, large deviations, and approximate pattern matching, Source Coding, Large Deviations, and Approximate Pattern Matching, pp.1590-1615, 2002.
DOI : 10.1109/TIT.2002.1003841
URL : http://arxiv.org/abs/math/0103007

H. Dickinson and M. M. Dodson, Extremal manifolds and Hausdorff dimension, Duke Math, J, vol.101, pp.271-281, 2000.

M. Drmota, A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions, European Journal of Combinatorics, vol.15, issue.2, pp.139-152, 1994.
DOI : 10.1006/eujc.1994.1016

M. Drmota, H. Hwang, and W. Szpankowski, Precise average redundancy of an idealized arithmetic coding, Proceedings DCC 2002. Data Compression Conference, pp.222-231, 2002.
DOI : 10.1109/DCC.2002.999960

M. Drmota and W. Szpankowski, Precise Minimax Redundancy and Regret, IEEE Transactions on Information Theory, vol.50, issue.11, pp.2686-2707, 2004.
DOI : 10.1109/TIT.2004.836702
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.2742

M. Drmota and W. Szpankowski, Variations on Khodak's Variable-to-Variable Codes, 42-nd Annual Allerton Conference on Communication, Control, and Computing, 2004.

M. Drmota and W. Szpankowski, On the exit time of a random walk with the positive drift, Proc. Discrete Mathematics and Theoretical Computer Science, pp.291-302, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01184773

M. Drmota, Y. Reznik, S. Savari, and W. Szpankowski, Tunstall Code, Khodak Variations, and random Walks, preprint Khodak Variations, and random Walks, preprint available on http

Y. Ephraim and N. Merhav, Hidden Markov processes, IEEE Transactions on Information Theory, vol.48, issue.6, pp.1518-1569, 2002.
DOI : 10.1109/TIT.2002.1003838

F. Fabris, Variable-length-to-variable length source coding: a greedy step-by-step algorithm, IEEE Transactions on Information Theory, vol.38, issue.5, pp.1609-1617, 1992.
DOI : 10.1109/18.149517

M. Feder, N. Merhav, and M. Gutman, Universal prediction of individual sequences, IEEE Transactions on Information Theory, vol.38, issue.4, pp.1258-1270, 1992.
DOI : 10.1109/18.144706

P. Flajolet, Singularity analysis and asymptotics of Bernoulli sums, Theoretical Computer Science, vol.215, issue.1-2, pp.371-381, 1999.
DOI : 10.1016/S0304-3975(98)00220-5
URL : https://hal.archives-ouvertes.fr/inria-00073289

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics, Acta Informatica, vol.32, issue.4, pp.3-58, 1995.
DOI : 10.1007/BF01177551
URL : https://hal.archives-ouvertes.fr/inria-00074307

. Ph, A. M. Flajolet, and . Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math, vol.3, pp.216-240, 1990.

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

P. Flajolet and W. Szpankowski, Analytic variations on redundancy rates of renewal processes, IEEE Transactions on Information Theory, vol.48, issue.11, pp.2911-2921, 2002.
DOI : 10.1109/TIT.2002.804115
URL : https://hal.archives-ouvertes.fr/inria-00073130

G. H. Freeman, Divergence and the construction of variable-to-variable-length lossless codes by source-word extensions, [Proceedings] DCC `93: Data Compression Conference, pp.79-88, 1993.
DOI : 10.1109/DCC.1993.253142

R. Gallager, Information Theory and Reliable Communications, 1968.
DOI : 10.1007/978-3-7091-2945-6

R. Gallager, Variations on a theme by Huffman, IEEE Transactions on Information Theory, vol.24, issue.6, pp.668-674, 1978.
DOI : 10.1109/TIT.1978.1055959

V. Choi and M. J. Golin, Lopsided Trees, I: Analyses, Algorithmica, vol.31, issue.3, pp.240-290, 2001.
DOI : 10.1007/s00453-001-0063-1

D. He and E. Yang, Performance Analysis of Grammar-Based Codes Revisited, IEEE Transactions on Information Theory, vol.50, issue.7, pp.1524-1535, 2004.
DOI : 10.1109/TIT.2004.830781

P. Howard and J. Vitter, Analysis of arithmetic coding for data compression, [1991] Proceedings. Data Compression Conference, pp.3-12, 1991.
DOI : 10.1109/DCC.1991.213368

H. Hwang, Large deviations for combinatorial distributions. I. Central limit theorems, The Annals of Applied Probability, vol.6, issue.1, pp.297-319, 1996.
DOI : 10.1214/aoap/1034968075

P. Jacquet and W. Szpankowski, Analysis of digital tries with Markovian dependency, IEEE Transactions on Information Theory, vol.37, issue.5, pp.1470-1475, 1991.
DOI : 10.1109/18.133271

P. Jacquet and W. Szpankowski, Autocorrelation on words and its applications, Journal of Combinatorial Theory, Series A, vol.66, issue.2, pp.237-269, 1994.
DOI : 10.1016/0097-3165(94)90065-5
URL : https://hal.archives-ouvertes.fr/inria-00075453

P. Jacquet and W. Szpankowski, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Theoretical Computer Science, vol.144, issue.1-2, pp.161-197, 1995.
DOI : 10.1016/0304-3975(94)00298-W

P. Jacquet and W. Szpankowski, Entropy computations via analytic depoissonization, IEEE Transactions on Information Theory, vol.45, issue.4, pp.1072-1081, 1999.
DOI : 10.1109/18.761251
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.5820

P. Jacquet and W. Szpankowski, Analytical Depoissonization and Its Applications, Theoretical Computer Science in " Fundamental Study, pp.1-62, 1998.

P. Jacquet and W. Szpankowski, Markov Types and Minimax Redundancy for Markov Sources IEEE Trans, pp.1393-1402, 2004.

P. Jacquet, G. Seroussi, and W. Szpankowski, On the Entropy of a Hidden Markov Process, Data Compression Conference, pp.362-371, 2004.

P. Jacquet, G. Seroussi, and W. Szpankowski, On the entropy of a hidden Markov process, Theoretical Computer Science, vol.395, issue.2-3, pp.203-219, 2008.
DOI : 10.1016/j.tcs.2008.01.012

P. Jacquet, W. Szpankowski, and J. Tang, Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source, Algorithmica, vol.31, issue.3, pp.318-360, 2001.
DOI : 10.1007/s00453-001-0053-3

P. Jacquet, W. Szpankowski, and I. Apostol, A universal predictor based on pattern matching, IEEE Transactions on Information Theory, vol.48, issue.6, pp.1462-1472, 2002.
DOI : 10.1109/TIT.2002.1003834

S. Janson, Moments for first-passage and last-exit times, the minimum, and related quantities for random walks with positive drift, Advances in Applied Probability, vol.2, issue.04, pp.865-879, 1986.
DOI : 10.2307/3212942

F. Jelinek and K. S. Schneider, On Variable-length-to-block Coding, Trans. Information Theory IT-18, pp.765-774, 1972.

G. L. Khodak, Connection Between Redundancy and Average Delay of Fixed-Length Coding, All-Union Conference on Problems of Theoretical Cybernetics, p.12, 1969.

G. L. Khodak, Bounds of Redundancy Estimates for Word-based Encoding of Sequences Produced by a Bernoulli Source (Russian), Problemy Peredachi Informacii, pp.21-32, 1972.

J. C. Kieffer, A unified approach to weak universal source coding, IEEE Transactions on Information Theory, vol.24, issue.6, pp.340-360, 1978.
DOI : 10.1109/TIT.1978.1055960

J. C. Kieffer, Strong converses in source coding relative to a fidelity criterion, IEEE Transactions on Information Theory, vol.37, issue.2, pp.257-262, 1991.
DOI : 10.1109/18.75240

J. C. Kieffer, Sample converses in source coding theory, IEEE Transactions on Information Theory, vol.37, issue.2, pp.263-268, 1991.
DOI : 10.1109/18.75241

C. Knessl and W. Szpankowski, Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types, Proc. the Second Workshop on Analytic Algorithmics and Combinatorics, 2005.

D. E. Knuth, The Art of Computer Programming, Fundamental Algorithms, vol.1, 1997.

D. E. Knuth, The Art of Computer Programming, Seminumerical Algorithms, vol.2, 1998.

D. E. Knuth, The Art of Computer Programming, Sorting and Searching, vol.3, 1998.

D. E. Knuth, Linear Probing and Graphs, Algorithmica, pp.561-568, 1998.
DOI : 10.1007/pl00009240
URL : http://arxiv.org/abs/cs/9801103

D. E. Knuth, Selected Papers on the Analysis of Algorithms, 2000.

C. Krattenthaler and P. Slater, Asymptotic redundancies for universal quantum coding, IEEE Transactions on Information Theory, vol.46, issue.3, pp.801-819, 2000.
DOI : 10.1109/18.841164

R. Krichevsky and V. Trofimov, The performance of universal encoding, IEEE Transactions on Information Theory, vol.27, issue.2, pp.199-207, 1981.
DOI : 10.1109/TIT.1981.1056331

I. Kontoyiannis, An Implementable Lossy Version of the Lempel-Ziv Algorithm ? Part I: Optimality for Memoryless Sources, IEEE Trans. Information Theory, vol.45, pp.2285-2292, 1999.

I. Kontoyiannis, Pointwise redundancy in lossy data compression and universal lossy data compression, IEEE Transactions on Information Theory, vol.46, issue.1, pp.136-152, 2000.
DOI : 10.1109/18.817514

I. Kontoyiannis, Sphere-covering, measure concentration, and source coding, IEEE Transactions on Information Theory, vol.47, issue.4, pp.1544-1552, 2001.
DOI : 10.1109/18.923735
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.585.5188

L. Kuipers and H. Niederreiter, Uniform Distribution of Sequences, 1974.

J. Lawrence, A new universal coding scheme for the binary memoryless source, IEEE Transactions on Information Theory, vol.23, issue.4, pp.466-472, 1977.
DOI : 10.1109/TIT.1977.1055749

A. Lempel and J. Ziv, On the Complexity of Finite Sequences, IEEE Transactions on Information Theory, vol.22, issue.1, pp.75-81, 1976.
DOI : 10.1109/TIT.1976.1055501

T. Linder, G. Lugosi, and K. Zeger, Fixed-rate universal lossy source coding and rates of convergence for memoryless sources, IEEE Transactions on Information Theory, vol.41, issue.3, pp.665-676, 1995.
DOI : 10.1109/18.382013

S. Lonardi, W. Szpankowski, and M. Ward, Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments, IEEE Transactions on Information Theory, vol.53, issue.5, pp.1799-1813, 2007.
DOI : 10.1109/TIT.2007.894689
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.7167

G. Louchard and W. Szpankowski, Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm, IEEE Transactions on Information Theory, vol.41, issue.2, pp.478-488, 1995.
DOI : 10.1109/18.370149

G. Louchard and W. Szpankowski, On the average redundancy rate of the Lempel-Ziv code, IEEE Transactions on Information Theory, vol.43, issue.1, pp.2-8, 1997.
DOI : 10.1109/18.567640

G. Louchard, W. Szpankowski, and J. Tang, Average Profile for the Generalized Digital Search Trees and the Generalized Lempel-Ziv Algorithms, SIAM J. Computing, vol.28, pp.935-954, 1999.

T. Luczak and W. Szpankowski, A suboptimal lossy data compression based on approximate pattern matching, IEEE Transactions on Information Theory, vol.43, issue.5, pp.1439-1451, 1997.
DOI : 10.1109/18.623143

H. Mahmoud, Evolution of Random Search Trees, 1992.

K. Marton and P. Shields, The positive-divergence and blowing-up properties, Israel Journal of Mathematics, vol.135, issue.1-3, pp.331-348, 1994.
DOI : 10.1007/BF02773685

N. Merhav and D. Neuhoff, Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes, IEEE Transactions on Information Theory, vol.38, issue.1, pp.135-140, 1992.
DOI : 10.1109/18.108258

N. Merhav, M. Feder, and M. Gutman, Some properties of sequential predictors for binary Markov sources, IEEE Transactions on Information Theory, vol.39, issue.3, pp.887-892, 1993.
DOI : 10.1109/18.256496

N. Merhav and M. Feder, A strong version of the redundancy-capacity theorem of universal coding, IEEE Transactions on Information Theory, vol.41, issue.3, pp.714-722, 1995.
DOI : 10.1109/18.382017

N. Merhav and J. Ziv, On the amount of statistical side information required for lossy data compression, IEEE Transactions on Information Theory, vol.43, issue.4, pp.1112-1121, 1997.
DOI : 10.1109/18.605571

A. Odlyzko, Asymptotic Enumeration, Handbook of Combinatorics, pp.1063-1229, 1995.

A. Orlitsky, P. Santhanam, and J. , Universal Compression of Memoryless Sources Over Unknown Alphabets, IEEE Transactions on Information Theory, vol.50, issue.7, pp.1469-1481, 2004.
DOI : 10.1109/TIT.2004.830761

A. Orlitsky and P. Santhanam, Speaking of Infinity, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2215-2230, 2004.
DOI : 10.1109/TIT.2004.834734

D. Ornstein and P. Shields, Universal Almost Sure Data Compression, The Annals of Probability, vol.18, issue.2, pp.441-452, 1990.
DOI : 10.1214/aop/1176990840

D. Ornstein and B. Weiss, Entropy and data compression schemes, IEEE Transactions on Information Theory, vol.39, issue.1, pp.78-83, 1993.
DOI : 10.1109/18.179344

E. Plotnik, M. J. Weinberger, and J. Ziv, Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm, IEEE Transactions on Information Theory, vol.38, issue.1, pp.66-72, 1992.
DOI : 10.1109/18.108250

Y. Reznik and W. Szpankowski, On the average redundancy rate of the Lempel???Ziv code with the k-error protocol, Information Sciences, vol.135, issue.1-2, pp.57-70, 2001.
DOI : 10.1016/S0020-0255(01)00101-3

J. Rissanen, Complexity of strings in the class of Markov sources, IEEE Transactions on Information Theory, vol.32, issue.4, pp.526-532, 1984.
DOI : 10.1109/TIT.1986.1057210

J. Rissanen, Universal coding, information, prediction, and estimation, IEEE Transactions on Information Theory, vol.30, issue.4, pp.629-636, 1984.
DOI : 10.1109/TIT.1984.1056936

J. Rissanen, Fisher information and stochastic complexity, IEEE Transactions on Information Theory, vol.42, issue.1, pp.40-47, 1996.
DOI : 10.1109/18.481776

B. Ryabko, Twice-Universal Coding, Problems of Information Transmission, pp.173-177, 1984.

B. Ryabko, Prediction of Random Sequences and Universal Coding, Problems of Information Transmission, pp.3-14, 1988.

B. Ryabko, The Complexity and Effectiveness of Prediction Algorithms, Journal of Complexity, vol.10, issue.3, pp.281-295, 1994.
DOI : 10.1006/jcom.1994.1015

S. Savari, Redundancy of the Lempel-Ziv incremental parsing rule, IEEE Transactions on Information Theory, vol.43, issue.1, pp.9-21, 1997.
DOI : 10.1109/18.567642

S. A. Savari, Variable-to-fixed length codes for predictable sources, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), pp.481-490, 1998.
DOI : 10.1109/DCC.1998.672213

S. A. Savari, Variable-to-fixed length codes and the conservation of entropy, IEEE Transactions on Information Theory, vol.45, issue.5, pp.1612-1620, 1999.
DOI : 10.1109/18.771231

S. Savari and R. Gallager, Generalized Tunstall codes for sources with memory, IEEE Transactions on Information Theory, vol.43, issue.2, pp.658-668, 1997.
DOI : 10.1109/18.556121

J. Schalkwijk, An algorithm for source coding, IEEE Transactions on Information Theory, vol.18, issue.3, pp.395-399, 1972.
DOI : 10.1109/TIT.1972.1054832

R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, 1995.

G. Seroussi, On universal types, IEEE Transactions on Information Theory, vol.52, issue.1, pp.171-189, 2006.
DOI : 10.1109/TIT.2005.860437

G. Seroussi, On the Number of t-Ary Trees with a Given Path Length, Algorithmica, pp.557-565, 2006.

P. Shields, Universal redundancy rates do not exist, IEEE Transactions on Information Theory, vol.39, issue.2, pp.520-524, 1993.
DOI : 10.1109/18.212281

P. Shields, The Ergodic Theory of Discrete Sample Path, 1996.
DOI : 10.1090/gsm/013

Y. Shtarkov, Universal Sequential Coding of Single Messages, Problems of Information Transmission, pp.175-186, 1987.

Y. Shtarkov, T. Tjalkens, and F. M. Willems, Multi-alphabet Universal Coding of Memoryless Sources, Problems of Information Transmission, pp.114-127, 1995.

Y. Steinberg and M. Gutman, An algorithm for source coding subject to a fidelity criterion, based on string matching, Based on String Matching, pp.877-886, 1993.
DOI : 10.1109/18.256495

P. Stubley, On the redundancy of optimum fixed-to-variable length codes, Proceedings of IEEE Data Compression Conference (DCC'94), pp.90-97, 1994.
DOI : 10.1109/DCC.1994.305916

W. Szpankowski, Asymptotic properties of data compression and suffix trees, IEEE Transactions on Information Theory, vol.39, issue.5, pp.1647-1659, 1993.
DOI : 10.1109/18.259648

W. Szpankowski, A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors, SIAM Journal on Computing, vol.22, issue.6, pp.1176-1198, 1993.
DOI : 10.1137/0222070

W. Szpankowski, On asymptotics of certain sums arising in coding theory, IEEE Transactions on Information Theory, vol.41, issue.6, pp.2087-2090, 1995.
DOI : 10.1109/18.476341

W. Szpankowski, On Asymptotics of Certain Recurrences Arising in Universal Coding, Problems of Information Transmission, pp.55-61, 1998.

W. Szpankowski, Asymptotic average redundancy of Huffman (and other) block codes, IEEE Transactions on Information Theory, vol.46, issue.7, pp.2434-2443, 2000.
DOI : 10.1109/18.887856

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770

W. Szpankowski, One-to-one code and its anti-redundancy, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2008.
DOI : 10.1109/ISIT.2005.1523599
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.7913

T. Tjalkens and F. Willems, A universal variable-to-fixed length source code based on Lawrence's algorithm, IEEE Transactions on Information Theory, vol.38, issue.2, pp.247-253, 1992.
DOI : 10.1109/18.119684

B. Vallée, Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators, Algorithmica, vol.22, issue.4, pp.660-685, 1998.
DOI : 10.1007/PL00009246

B. Vallée, Dynamical sources in information theory: Fundamental intervals and word prefixes, Algorithmica, vol.81, issue.2, pp.262-306, 2001.
DOI : 10.1007/BF02679622

K. Visweswariah, S. Kulkurani, and S. Verdu, Universal variable-to-fixed length source codes, IEEE Transactions on Information Theory, vol.47, issue.4, pp.1461-1472, 2001.
DOI : 10.1109/18.923727
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.7125

J. Vitter and P. Krishnan, Optimal prefetching via data compression, Journal of the ACM, vol.43, issue.5, pp.771-793, 1996.
DOI : 10.1145/234752.234753
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.5169

M. Ward and W. Szpankowski, Analysis of a Randomized Selection Algorithm Motivated by the LZ'77 Scheme, The First Workshop on Analytic Algorithmics and Combinatorics, pp.153-160, 2004.

M. Weinberger, N. Merhav, and M. Feder, Optimal sequential probability assignment for individual sequences, IEEE Transactions on Information Theory, vol.40, issue.2, pp.384-396, 1994.
DOI : 10.1109/18.312161

M. Weinberger, J. Rissanen, and M. Feder, A universal finite memory source, IEEE Transactions on Information Theory, vol.41, issue.3, pp.643-652, 1995.
DOI : 10.1109/18.382011

M. Weinberger, J. Rissanen, and R. Arps, Applications of universal context modeling to lossless compression of gray-scale images, IEEE Transactions on Image Processing, vol.5, issue.4, pp.575-586, 1996.
DOI : 10.1109/83.491334

M. Weinberger, G. Seroussi, and G. Sapiro, LOCO-I: a low complexity, context-based, lossless image compression algorithm, Proceedings of Data Compression Conference, DCC '96, pp.140-149, 1996.
DOI : 10.1109/DCC.1996.488319
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.8011

F. M. Willems, Y. Shtarkov, and T. Tjalkens, The context-tree weighting method: basic properties, IEEE Transactions on Information Theory, vol.41, issue.3, pp.653-664, 1995.
DOI : 10.1109/18.382012
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.352

F. M. Willems, Y. Shtarkov, and T. Tjalkens, Context weighting for general finite-context sources, IEEE Transactions on Information Theory, vol.42, issue.5, pp.1514-1520, 1996.
DOI : 10.1109/18.532891

P. Whittle, Some Distribution and Moment Formulae for Markov Chain, J. Roy. Stat. Soc., Ser. B, vol.17, pp.235-242, 1955.

A. D. Wyner, An upper bound on the entropy series, Information and Control, vol.20, issue.2, pp.176-181, 1972.
DOI : 10.1016/S0019-9958(72)90365-8

A. J. Wyner, The Redundancy and Distribution of the Phrase Lengths of the Fixed-Database Lempel-Ziv Algorithm, IEEE Trans. Information Theory, vol.43, pp.1439-1465, 1997.

A. Wyner and J. Ziv, Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression, IEEE Transactions on Information Theory, vol.35, issue.6, pp.1250-1258, 1989.
DOI : 10.1109/18.45281

Q. Xie and A. Barron, Minimax Redundancy for the Class of Memoryless Sources, IEEE Trans. Information Theory, vol.43, pp.647-657, 1997.

Q. Xie and A. Barron, Asymptotic Minimax Regret for Data Compression, Gambling, and Prediction, IEEE Trans. Information Theory, vol.46, pp.431-445, 2000.

E. H. Yang and J. Kieffer, Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm, IEEE Transactions on Information Theory, vol.42, issue.1, pp.239-245, 1996.
DOI : 10.1109/18.481794

E. H. Yang and J. Kieffer, On the redundancy of the fixed-database Lempel-Ziv algorithm for ??-mixing sources, IEEE Transactions on Information Theory, vol.43, issue.4, pp.1101-1111, 1997.
DOI : 10.1109/18.605570

E. H. Yang and J. Kieffer, On the Performance of Data Compression Algorithms Based upon String Matching, IEEE Trans. Information Theory, vol.44, 1998.

E. H. Yang and Z. Zhang, The shortest common superstring problem: average case analysis for both exact and approximate matching, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1867-1886, 1999.
DOI : 10.1109/18.782108

Y. Yang and A. Barron, Information-Theoretic Determination of Minimax Rates of Convergence, The Ann. Stat, vol.27, pp.1564-1599, 1999.

Z. Zhang and V. Wei, An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results, IEEE Transactions on Information Theory, vol.42, issue.3, pp.803-821, 1996.
DOI : 10.1109/18.490546

J. Ziv, Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterion, IEEE Transactions on Information Theory, vol.18, issue.3, pp.389-394, 1972.
DOI : 10.1109/TIT.1972.1054831

J. Ziv, Correction to "Variable-to fixed length codes are better than fixed-to-variable length codes for Markov sources", IEEE Transactions on Information Theory, vol.39, issue.1, pp.861-863, 1990.
DOI : 10.1109/TIT.1993.1603954

J. Ziv, Back from infinity: a constrained resources approach to information theory, Proceedings of IEEE International Symposium on Information Theory, pp.30-33, 1998.
DOI : 10.1109/ISIT.1997.612919

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714

J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, vol.24, issue.5, pp.530-536, 1978.
DOI : 10.1109/TIT.1978.1055934