par Louchard, Guy 
;Szpankowski, Wojciech
Référence IEEE transactions on information theory, 41, 2, page (478-488)
Publication Publié, 1995-03
;Szpankowski, WojciechRéférence IEEE transactions on information theory, 41, 2, page (478-488)
Publication Publié, 1995-03
Article révisé par les pairs
| Résumé : | Consider the parsing algorithm developed by Lempel and Ziv that partitions a sequence of length n into variable phrases (blocks) such that a new block is the shortest substring parameters are of interest: number of phrases, the size of a phrase, the number of phrases of given size, and so forth. In this paper, we focus on the size of a randomly selected phrase, and the average number of phrases of a given size (the so-called average profile of phrase sizes). These parameters can be efficiently analyzed through a digital search tree representation. For a memoryless source with unequal probabilities of symbols generation (the so-called asymmetric Bernoulli model), we prove that the size of a typical phrase is asymptotically normally distributed with mean and variance explicitly computed. In terms of digital search trees, we prove the normal limiting distribution of the typical depth (i.e., the length of a path from the root to a randomly selected node). The latter finding is proved by a technique that belongs to the toolkit of the 'analytical analysis of algorithms,' and it seems to be novel in the context of data compression. |
