Comparing the Lempel-Ziv Family of Algorithms
Dr. Bhupendra Verma1 and A. B. Bavani Sankar 1*
1Technocrats Institute of Technology, Bhopal , Madhya Pradesh - 462021 India

Abstract-
When storage space falls short, or when time required to transfer is to be reduced, compression is the method used to manipulate the data and reduce its overall size. Compression can also be used to simply package a set of files for ease of distribution. Lossless compression of data is used extensively to avoid degradation of data and to retrieve data as was before packaging. In this paper, one of the pioneering algorithms, “LZ” (by Lempel and Ziv), and its popular variants are compared and discussed to make clear its places of application and viability.

1. Introduction …show more content…
Compression can be implemented in two ways, either lossy or lossless. While sometimes, data loss can be tolerated (as in image, video or audio compression); sometimes it cannot be, like in messages - which have to be decompressed to the same state as they were before compression – or the data fails to fulfil the intended purpose. So, compression of data can be classified as lossy and lossless.
The algorithm discussed in this paper is LZ; the algorithm developed by Abraham Lempel and Jacob Ziv, which is reliable, but has also grown old. But, many variants of this algorithm have been