Analytic variations on redundancy rates of renewal processes

IEEE Transactions on Information Theory

Volumn 48, Issue 11, 2002, Pages 2911-2921

  Flajolet, Philippe ^b   Szpankowski, Wojciech ^a,c  

^a IEEE   (United States)

^b INRIA ROCQUENCOURT   (France)

^c Purdue University   (United States)

Author keywords

Analytic information theory; Mellin transform; Partitions of integers; Redundancy; Renewal processes; Saddle point method; Tree function; Universal coding

Indexed keywords

ANALYTIC INFORMATION THEORY; MELLIN TRANSFORM; RENEWAL PROCESSES; SADDLE POINT METHOD; TREE FUNCTION; UNIVERSAL CODING;

ASYMPTOTIC STABILITY; ESTIMATION; FUNCTION EVALUATION; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PROBABILITY; SIGNAL ENCODING; TREES (MATHEMATICS);

INFORMATION THEORY;

EID: 0036845157     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.804115     Document Type: Article

References (30)

1. G. E. Andrews, The Theory of Partitions. Cambridge, UK.: Cambridge Univ. Press, 1984.
2. A. Barron, J. Rissanen, and B. Yu, "The minimum description length principle in coding and modeling," IEEE Trans. Inform. Theory, vol. 44, pp. 2743-2760, Oct. 1998.
3. R. Corless, G. Gonnet, D. Hare, D. Jeffrey, and D. Knuth, "On the Lambert W function," Adv. Comput. Math., vol. 5, pp. 329-359, 1996.
4. I. Csiszár and P. Shields, "Redundancy rates for renewal and other processes," IEEE Trans. Inform. Theory, vol. 42, pp. 2065-2072, Nov. 1996.
5. N. G. De Bruijn, Asymptotic Methods in Analysis. New York: Dover, 1981.
6. M. Drmota and W. Szpankowski, "Generalized Shannon Code minimizes the maximal redundancy," in Proc. LATIN'02 (Lecture Notes on Computer Science). Berlin, Germany: Springer-Verlag, 2002, vol. 2286, pp. 306-318.
7. P. Flajolet and A. Odlyzko, "Singularity analysis of generating functions," SIAM J. Discr. Meth., vol. 3, pp. 216-240, 1990.
8. P. Flajolet, X. Gourdon, and P. Dumas, "Mellin transforms and asymptotics: Harmonic sums," Theor. Comp. Sci., vol. 144, pp. 3-58, 1995.
9. P. Flajolet and R. Sedgewick. Analytic Combinatorics book in preparation. [Online]. Available: http://pauillac.inria.fr/algo/flajolet/
10. G. H. Hardy and S. Ramanujan, "Asymptotic formulae in combinatorial analysis," Proc. London Math. Soc., ser. 2, vol. XVII, pp. 75-115, 1918.
11. P. Henrici, Applied and Computational Complex Analysis. New York: Wiley, 1977, vol. 3.
12. P. Jacquet and W. Szpankowski, "Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees," Theor. Comp. Sci., vol. 144, pp. 161-197, 1995.
13. ____, "Entropy computations via analytic depoissonization," IEEE Trans. Inform. Theory, vol. 45, pp. 1072-1081, May 1999.
14. P. Jacquet, W. Szpankowski, and J. Tang, "Average profile of the Lempel-Ziv parsing scheme for a Markovian source," Algorithmica, vol. 31, pp. 318-360, 2002.
15. G. Louchard and W. Szpankowski, "On the average redundancy rate of the Lempel-Ziv code," IEEE Trans. Inform. Theory, vol. 43, pp. 2-8, Jan. 1997.
16. A. Odlyzko, "Asymptotic enumeration," in Handbook of Combinatorics, R. Graham, M. Götschel, and L. Lovász, Eds. Amsterdam, The Netherlands: Elsevier, 1995, vol. II, pp. 1063-1229.
17. J. Rissanen, "Complexity of strings in the class of Markov sources," IEEE Trans. Inform. Theory, vol. IT-32, pp. 526-532, July 1986.
18. B. Salvy and J. Shackell, "Symbolic asymptotics: Multiseries of inverse functions," J. Symb. Comput., vol. 27, pp. 543-563, 1999.
19. S. Savari, "Redundancy of the Lempel-Ziv incremental parsing rule," IEEE Trans. Inform. Theory, vol. 43, pp. 9-21, Jan. 1997.
20. P. Shields, "Universal redundancy rates do not exist," IEEE Trans. Inform. Theory, vol. 39, pp. 520-524, 1993.
21. Y. Shtarkov, "Universal sequential coding of single messages," Probl. Inform. Transm., vol. 23, pp. 175-186, 1987.
22. W. Szpankowski, "On asymptotics of certain recurrences arising in universal coding," Probl. Inform. Transm., vol. 34, no. 2, pp. 55-61, 1998.
23. ____, Average Case Analysis of Algorithms on Sequences. New York: Wiley, 2001.
24. ____, "Asymptotic redundancy of Huffman (and other) block codes," IEEE Trans. Inform. Theory, vol. 46, pp. 2434-2443, 2000.
25. E. C. Titchmarsh, The Theory of the Riemann Zeta Function. Oxford, U.K.: Clarendon, 1951.
26. Q. Xie and A. Barron, "Minimax redundancy for the class of memoryless sources," IEEE Trans. Inform. Theory, vol. 43, pp. 646-657, Mar. 1997.
27. M. Weinberger, N. Merhav, and M. Feder, "Optimal sequential probability assignments for individual sequences," IEEE Trans. Inform. Theory, vol. 40, pp. 384-396, 1994.
28. E. M. Wright, "The coefficients of certain power series," J. London Math. Soc., vol. 7, pp. 256-262, 1932.
29. A. J. Wyner, "The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 43, pp. 1452-1464, Sept. 1997.
30. J. Siv, "Back from infinity: A constrained resources approach to information theory," IEEE Inform. Theory Soc. Newslett., vol. 48, pp. 1, 30-33, Mar. 1998.