An efficient lossless compression using double Huffman minimum variance encoding technique

A Huffman code is a particular type of optimal prefix code that is commonly used for loss-less data compression. The process of finding such a code is known as Huffman coding. The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol. The alg...

Full description

Saved in:
Bibliographic Details
Published in2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT) pp. 534 - 537
Main Authors Sandeep, G.S., Sunil Kumar, B.S., Deepak, D.J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2015
Subjects
Average length
Channel coding
Computer science
Data Compression
Double Huffman coding
Entropy
Huffman coding
Minimum Variance
Probability
Redundancy
Online AccessGet full text

Cover

More Information
Summary:A Huffman code is a particular type of optimal prefix code that is commonly used for loss-less data compression. The process of finding such a code is known as Huffman coding. The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol. The algorithm derives this table from the estimated probability or frequency of occurrence for each possible value of the source symbol. In this paper, we present a new approach to measure the performance and redundancy that work on two methods of coding like Huffman coding and Minimum Variance Huffman Coding. After getting the code-word for each symbol, we compress it on the basis of its binary values like 0 and 1 using binary coding. This is applied to both the approaches; this process is called as Double Huffman Coding. Finally we produce a better result than Huffman coding.
DOI:10.1109/ICATCCT.2015.7456942