DATA COMPRESSION USING HUFFMAN CODING TECHNIQUES & COMPARISON
Author(s):
SANTOSH KUMAR CHOUDHARY, Dr. DEEPAK SHARMA
Keywords:
Data compression, Huffman coding, Lossy compression, Lossless compression, Arithmetic coding.
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.
Article Details
Unique Paper ID: 150197

Publication Volume & Issue: Volume 7, Issue 2

Page(s): 432 - 435
Article Preview & Download


Share This Article

Go To Issue



Call For Paper

Volume 7 Issue 3

Last Date 25 August 2020

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews

Contact Details

Telephone:6351679790
Email: editor@ijirt.org
Website: ijirt.org

Policies