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

G. Fayolle, R. Iasnogorodski, and V. Malyshev, Random Walks in the Quarter-Plane: Algebraic Methods, Boundary Value Problems and Applications, 1999.

. 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, 2007.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

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

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

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

W. Schachinger, Limiting distributions for the costs of partial match retrievals in multidimensional tries, Random Structures and Algorithms, vol.1114, issue.1, pp.3-4, 2000.
DOI : 10.1002/1098-2418(200010/12)17:3/4<428::AID-RSA12>3.0.CO;2-6

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