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{150197,
        author = {SANTOSH KUMAR CHOUDHARY and Dr. DEEPAK SHARMA     },
        title = {DATA COMPRESSION USING HUFFMAN CODING TECHNIQUES & COMPARISON},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {7},
        number = {2},
        pages = {432-435},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=150197},
        abstract = {Data Compression is a technique used now days everywhere. Basically, it is the technology which is used in reducing the size of data by eliminating the redundancy of data available in the original file. It is essential for reducing the size of data while storing data and reduces time access as well as easy to store large file by data compression technique.
Data compressions may be either Lossy or Lossless. The lossy technique may not regenerate the original form of the source while the Lossless technique regenerates the original form of the source during data compression. Basically, Lossy technique used to compress data for video & audio. Due to this technique, the number of bits required while storing data is also reduced. 
There are various techniques available to reduce a large amount of data in which I have analyzed the Huffman coding algorithm and compare it with other algorithms available such as Arithmetic coding. Huffman Coding is easy while the implementation & utilization of reducing data storage.
},
        keywords = {Data compression, Huffman coding, Lossy compression, Lossless compression, Arithmetic coding.},
        month = {},
        }