E. Yang and J. Kieffer, "On the redundancy of the fixed-database Lempel-Ziv algorithm for OE-mixing sources," IEEE Trans. Inform. Theory, vol. 43, pp. 1101--1111, 1997.  Home/Search   Document Not in Database   Summary   Related Articles

.... p q k 1 log 2 q 1 Gamma p k 1 Gamma q k 1 For log 2 p= log 2 q rational, oscillation occurs: lim inf n 1 f(log 2 n)Rn g lim sup n 1 f(log 2 n)Rng The behavior of the redundancy Rn has also been examined for other variants of the Lempel Ziv algorithm (see for example the papers [7] [8]) 7 MPM Code The Lempel Ziv code partitions up the vector (X 1 ; X 2 ; Xn ) in a certain way, and the resulting codeword length is approximately equal to the entropy of this partition. The Multilevel Pattern Matching code (or MPM code, for short) 2] partitions up (X 1 ; X 2 ; Xn ....

E. Yang and J. Kieffer, "On the redundancy of the fixed-database Lempel-Ziv algorithm for OE-mixing sources," IEEE Trans. Inform. Theory, vol. 43, pp. 1101--1111, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC