Call for Paper - May 2023 Edition
IJCA solicits original research papers for the May 2023 Edition. Last date of manuscript submission is April 20, 2023. Read More

Renovation in Compression Expertness of Huffman Coding and Intelligent Data Encryption

Print
PDF
 
Download Full Text
International Journal of Computer Applications
© 2013 by IJCA Journal
Volume 74 - Number 14
Year of Publication: 2013
Authors:
Farrukh Fareed
Shiva Chaudhary
10.5120/12952-9977

Farrukh Fareed and Shiva Chaudhary. Article: Renovation in Compression Expertness of Huffman Coding and Intelligent Data Encryption. International Journal of Computer Applications 74(14):13-18, July 2013. Full text available. BibTeX

@article{key:article,
	author = {Farrukh Fareed and Shiva Chaudhary},
	title = {Article: Renovation in Compression Expertness of Huffman Coding and Intelligent Data Encryption},
	journal = {International Journal of Computer Applications},
	year = {2013},
	volume = {74},
	number = {14},
	pages = {13-18},
	month = {July},
	note = {Full text available}
}

Abstract

Data compression is used for reducing storage requirements. It involves transforming data of a given format, called source message, to data of a smaller sized format, called compressed message. The Data compression helps in reducing the size of the database so that it is very easy to maintain huge database. On the other hand Type Casting is used to convert the input source message into suitable format so that Huffman Algorithm can work on maximum data formats and after that Data Normalization technique is used to remove redundancy from the data this technique enhance the compression efficiency of Huffman Algorithm. Decreasing the amount of data required representing a source of information while preserving the original content as much as possible and after that providing security to this compressed code word with the application of data encryption. The main objectives of this paper are to get higher compression efficiency by applying a planned technique on Huffman Algorithm and providing security to this compressed data to limit the unauthorized access using data encryption.

References

  • Mohd. Faisal Muqtida and Raju Singh Kushwaha, "Improvement in Compression Efficiency of Huffman Coding", International Journal of Computer Applications (0975 – 8887) Volume 45– No. 24, May 2012.
  • S. Mohankrishna, Singuru SriHari, T. V. Trinadh, G. Raja Kumar,"A Novel Approach for Reduction of Huffman Cost Table in Image Compression", International Journal of Computer Applications (0975 – 8887) Volume 20– No. 6, April 2011.
  • A Method for the Construction of Minimum-Redundancy Codes David A. Huffman, Associate, IRE. (1952).
  • Bao Ergude, Li Weisheng, Fan Dongrui, Ma Xiaoyu, " A study and implementation of the Huffman Algorithm based on condensed Huffman table", Computer Science and Software Engineering, 2008 International Conference on (Volume: 6), ISBN: 978-0-7695-3336-0
  • 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.
  • Abraham Sinkov, "Elementary Cryptanalysis: A Mathematical Approach", Mathematical Association of America, 1966. ISBN 0-88385-622-0.
  • Ternary Tree & A new Huffman Decoding Technique, IJCSNS International Journal of Computer Science and Network Security, Vol. 10 N0. 3, March 2010.
  • A guide to MATLAB by Brian R. Hunt, Ronald L. Lipsman, J. M. Rosenberg Cambridge Univ. Press. ISBN No. 0-521- 00859-X.
  • D. Kahn 1967, "The Code breakers", The Story of Secret Writing. New York: Macmillan.