By Topic

Asymptotic behavior of the Lempel-Ziv parsing scheme and digital trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jacquet, P. ; Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France ; Szpankowski, W.

For the memoryless source with unequal probabilities of symbols generation we derive the limiting distribution for the number of phrases in the Lempel-Ziv (1978) parsing scheme. This proves a long standing open problem. In order to establish it we had to solve another open problem, namely, that of deriving the limiting distribution of the internal path length in a digital search tree

Published in:

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Date of Conference:

17-22 Sep 1995