Precise asymptotic analysis of the Tunstall code Conference Paper

abstract

• We study the Tunstall code using the machinery from the analysis of algorithms literature. In particular, we propose an algebraic characterization of the Tunstall code which, together with tools like the Mellin transform and the Tauberian theorems, leads to new results on the variance and a central limit theorem for dictionary phrase lengths. This analysis also provides a new argument for obtaining asymptotic results about the mean dictionary phrase length and average redundancy rates. 2006 IEEE.

name of conference

• 2006 IEEE International Symposium on Information Theory

authors

• Savari, Serap

published proceedings

• 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS

author list (cited authors)

• Drmota, M., Reznik, Y., Savari, S. A., & Szpankowski, W.

citation count

• 8

complete list of authors

• Drmota, Michael||Reznik, Yuriy||Savari, Serap A||Szpankowski, Wojciech

publication date

• July 2006

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

keywords

• 46 Information And Computing Sciences
• 49 Mathematical Sciences
• 4901 Applied Mathematics

Digital Object Identifier (DOI)

• 10.1109/ISIT.2006.261984

International Standard Book Number (ISBN) 10

• 1424405041

International Standard Book Number (ISBN) 13

• 978-1-4244-0505-3

start page

• 2334

end page

• +

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fisit.2006.261984