Research Article
Improvement in Compression Efficiency of Huffman Coding
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 45 - Issue 24 |
| Published: May 2012 |
| Authors: Mohd. Faisal Muqtida, Raju Singh Kushwaha |
10.5120/7115-9476
|
Mohd. Faisal Muqtida, Raju Singh Kushwaha . Improvement in Compression Efficiency of Huffman Coding. International Journal of Computer Applications. 45, 24 (May 2012), 33-39. DOI=10.5120/7115-9476
@article{ 10.5120/7115-9476,
author = { Mohd. Faisal Muqtida,Raju Singh Kushwaha },
title = { Improvement in Compression Efficiency of Huffman Coding },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 45 },
number = { 24 },
pages = { 33-39 },
doi = { 10.5120/7115-9476 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Mohd. Faisal Muqtida
%A Raju Singh Kushwaha
%T Improvement in Compression Efficiency of Huffman Coding%T
%J International Journal of Computer Applications
%V 45
%N 24
%P 33-39
%R 10.5120/7115-9476
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Compression helps in reducing the redundancy in the data representation so as to reduce the storage requirement of it. The task of compression consists of two components, an encoding algorithm that takes a message and generates a "compressed" representation and a decoding algorithm that reconstructs the original message or some approximation of it from the compressed representation. Many algorithms are available for compressing the data. Some of the algorithms help in achieving lossless compression and some are good at lossy compression. In this paper, the proposed technique has improved the better compression ratio and compression efficiency on the Huffman Coding on data. The proposed technique works even with image file also but conventional Huffman Algorithm cannot do this. This paper also outlines the use of Data Normalization on the text data so as to remove redundancy for more data compression.
References
- Ternary Tree & A new Huffman Decoding Technique, IJCSNS International Journal of Computer Science and Network Security, Vol. 10 N0. 3, March 2010.
- A Study and implementation of the Huffman Algorithm based on Condensed Huffman Table, 2008 International Conference on Computer Science and Software Engineering.
- A Method for the Construction of Minimum-Redundancy Codes David A. Huffman, Associate, IRE. (1952).
- Typecasting, Legitimation: A Formal Theory Greta Hsu Univ. Of California at Davis Michael t. Hannan Stanford University.
- Database Normalisation: Korth Refrences:A CS2 assignment.
- Database System Concepts By SILBERSCHATZ, KORTH, SUDARSHAN McGraw-Hill Higher Education, ISBN NO. 0-07-120413-X
- A Method for the Construction of Minimum-Redundancy Codes DAVID A. HUFFMAN, ASSOCIATE,IRE.
- A study and implementation of the Huffman Algorithm based on condensed Huffman table, 2008 Software Engineering.
- Owen L. Astrachan,2004,Huffman coding:A CS2 assignment.
- Typecasting, Legitimation , and Form Emergence: A Formal Theory Greta Hsu Univ. of California at Davis Michael T. Hannan Stanford University László Pólos Durham University Running head: Typecasting, Legitimation, and Form Emergence March 24, 2010
Index Terms
Keywords