DocumentCode
2623127
Title
Exact analysis of the Lempel-Ziv algorithm for unifilar Markov source
Author
Kawabata, Tsutomu
Author_Institution
Univ. of Electro-Communication, Tokyo
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
13
Abstract
We find an exact formula of the expected length of the i-th parsed segment on a state dependent parsing tree which results from the state dependent Lempel-Ziv incremental parsing algorithm applied to a unifilar Markov source, Our expectation appears in the formulation of the rate of a variable-to-variable length Lempel-Ziv scheme. We argue its asymptotic behavior and prove a universal source coding theorem
Keywords
Markov processes; grammars; source coding; trees (mathematics); Lempel-Ziv incremental parsing algorithm; asymptotic behavior; exact formula; state dependent parsing tree; unifilar Markov source; universal source coding theorem; Algorithm design and analysis; Binary codes; Indium tin oxide; Light rail systems; Source coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394958
Filename
394958
Link To Document