Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{142504,
        author = {Harman Jot and Mrs.Rupinder kaur},
        title = {FAST LEMPEL-ZIV (LZ’78) COMPLEXITY ESTIMATION USING CODEBOOK HASHING},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {2},
        number = {2},
        pages = {215-219},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=142504},
        abstract = {Compression is useful as it helps reduce resources usage, such as storage space or transmission capacity. But we must decompress the compressed data before use. This overhead processing imposes extra computational costs. For instance, a compression scheme for video may require expensive hardware for the video to be decompressed fast enough to be viewed as it is being decompressed, [1] and the option to decompress the video in full before watching it may be inconvenient or require additional storage. The design of data compression schemes involves trade-offs among various factors, including the degree of compression, the amount of distortion introduced and the computational resources required to compress and un-compress the data.[2]
An order over some alphabet typically exhibits some regularities, what is essential to think of compression. For distinctive English texts we can spot that the most regular letters are e, t, a, and the least regular letters are q, z. We can also discover such words as the, of, to regularly. Often also longer remains of the text reappearance, probably even the whole sentences. We can use these stuffs in some way, and the succeeding sections elaborate this matter. 
},
        keywords = {LEMPEL-ZIV (LZ’78), COMPLEXITY, CODEBOOK, HASH},
        month = {},
        }