High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Huffman tree and lossless Data compression using Huffman method and comparison with other technique.

Author(s):

Wasim Firuj Ahmed , VIT UNIVERSITY,Vellore; Sanjukta, VIT UNIVERSITY,Vellore

Keywords:

Huffman, lossless, lossy, run length encoding, arithmetic coding

Abstract

This paper investigates and shows us how to create a tree from leaf node. Huffman tree is built from bottom up rather than top down that is creation of tree starting from leaf node and proceed upwards. Also this paper shows us the application of Huffman tree that is in lossless data compression and it is compared with other compression techniques. I have analyzed Huffman and compared it with arithmetic coding. Data compression is a process that reduces size of the data which is useful as cost will be reduced and redundancy in data is also reduced. Data compression is used in distributed system. So for speed and performance efficiency data compression is used there.

Other Details

Paper ID: IJSRDV2I9120
Published in: Volume : 2, Issue : 9
Publication Date: 01/12/2014
Page(s): 680-683

Article Preview

Download Article