Point-wise analysis of redundancy in SWLZ algorithm for &amp;#x03C6;-mixing sources

Ayush Jain,Rakesh K Bansal

doi:10.1109/itw.2015.7133103

Point-wise analysis of redundancy in SWLZ algorithm for &#x03C6;-mixing sources

Ayush Jain, Rakesh K Bansal

https://doi.org/10.1109/itw.2015.7133103

Copy DOI

Publication Date: Apr 1, 2015

Citations: 15

Affiliation: Indian Institute of Technology Kanpur

#Sliding Window Lempel-Ziv #Sliding Window Lempel-Ziv Algorithm + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

In this paper, we bound the number of phrases of the sliding window Lempel-Ziv (SWLZ) algorithm using an upper bound on the expected number of phrases in the fixed database Lempel-Ziv (FDLZ) algorithm for a class of φ-mixing sources which includes Markov sources, unifilar sources and finite state sources as special cases, as developed by Yang and Kieffer [1]. We use this bound to obtain a point-wise upper bound on the redundancy rate of SWLZ algorithm to be equation Here H is the entropy rate of the source and n w is the window size.

Full Text