CFP last date
20 March 2025
Call for Paper
April Edition
IJCA solicits high quality original research papers for the upcoming April edition of the journal. The last date of research paper submission is 20 March 2025

Submit your paper
Know more
The week's pick
Responsive image
Adaptive Congestion Control Protocol based on Meta-Reinforcement Learning for Data Communication Networks

Mugoh Mwaura Stephen Kiambi Hezekiah Nganga
Random Articles
Reseach Article

Web Page Compression using Huffman Coding Technique

Published on April 2012 by Manjeet Gupta, Brijesh Kumar
journal_cover_thumbnail

International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012)
Foundation of Computer Science USA
IRAFIT - Number 4
April 2012
Authors: Manjeet Gupta, Brijesh Kumar

Manjeet Gupta, Brijesh Kumar . Web Page Compression using Huffman Coding Technique. International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012). IRAFIT, 4 (April 2012), 10-12.

@article{
author = { Manjeet Gupta, Brijesh Kumar },
title = { Web Page Compression using Huffman Coding Technique },
journal = { International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012) },
issue_date = { April 2012 },
volume = { IRAFIT },
number = { 4 },
month = { April },
year = { 2012 },
issn = 0975-8887,
pages = { 10-12 },
numpages = 3,
url = { /proceedings/irafit/number4/5871-1027/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012)
%A Manjeet Gupta
%A Brijesh Kumar
%T Web Page Compression using Huffman Coding Technique
%J International Conference on Recent Advances and Future Trends in Information Technology (iRAFIT 2012)
%@ 0975-8887
%V IRAFIT
%N 4
%P 10-12
%D 2012
%I International Journal of Computer Applications
Abstract

Compression helps in reducing the redundancy in the data representation so as to reduce the storage requirement of it. Compression is an important technique used to improve web retrieval latency Compression is an important technique used to improve web retrieval latency. Plethora of algorithms is available for compressing the data. Some of the algorithms helps in achieving lossless compression and some are good at lossy compression. The objective of this study is to analyze the amount of compression that can be achieved by the use of existing Huffman Coding on web pages and to suggest further improvement that can be done to compress web pages so as to achieve better compression ratio and compression efficiency. The proposed technique may works even better with large files. How d o u know . This paper also outlines the comparison of various compression methods using different parameters.

References
  1. Ahmed Desoky and Mark Gregory, Compression of text and binary files using Adaptive Huffman Coding Techniques.In Proceedings of IEEE conference, Aug, 2002, U.S.A.
  2. D.A. Huffman 1952,A method for the construction of minimum redundancy codes, IRE 40, 9, (Sept 1952), 1089- 1101.
  3. David A. Clunie, 2000, Lossless Compression of Grayscale Medical Images- Traditional and State of the Art (Approaches,www.dclunie.com/papers//spie_mi_2000_compression).
  4. H.Kruse and a. Mukherjee, Data compression using Text encryption, Proceedings of the Data compression Conference, 1997,IEEE computer Society Press,pp.447.
  5. Owen L.Astrachan,2004,Huffman coding:A CS2 assignment.
  6. F.Awan, and A. Mukherjee ,LIPT: A lossless Text Transform to improve compression, Proceedings of International conference on information and Theory :Coding and Computing, IEEE Computer Society ,Las Vagas Nevada ,April 2001.
  7. Manber U,1994 A Text Compression scheme that allows fast searching directly in the compressed file ,pro.of ombinatorial pattern matching (lecture Notes in computer science V807), Springer: London ,113-124.
  8. T.Welch,1984 "A Technique for High-Performance data Compression",IEEE Computer,Vol 17.
  9. M.Burrows and D.J. Wheeler. Nov2011, A Block- sorting Lossless Data Compression Algorithm,SRC Research Report 124,Digital Systems Research centre.
  10. J.Ziv and A.Lempel, 1977,A universal algorithm for sequential data compression, IEEE Trans.inform.Theory, vol.IT-23, no.3, pp.337-343.
Index Terms

Computer Science
Information Sciences

Keywords

Compression Compression Ratio Redundancy Codes Lossless