On point-wise redundancy rate of Bender-Wolf's variant of SWLZ algorithm

Abstract

In this paper we analyse the redundancy rate of a variant of sliding window Lempel-Ziv (SWLZ) proposed by Bender and Wolf, which encodes phrase lengths differently from the original algorithm. We examine upper bound on the contribution of phrase length bits for this variant to get an overall upper bound of O(1/log n w ) on the redundancy rate for Markov sources which is better than the lower bound of O(log log n w /log n w ), established by the Lastras-Montano for SWLZ algorithm. Here n w denotes the window size.