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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Dictionary based Efficient Text Compression Technique using Replacement Strategy

by Debashis Chakraborty, Debajyoti Ghosh, Piyali Ganguly
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 116 - Number 16
Year of Publication: 2015
Authors: Debashis Chakraborty, Debajyoti Ghosh, Piyali Ganguly
10.5120/20420-2720

Debashis Chakraborty, Debajyoti Ghosh, Piyali Ganguly . A Dictionary based Efficient Text Compression Technique using Replacement Strategy. International Journal of Computer Applications. 116, 16 ( April 2015), 19-23. DOI=10.5120/20420-2720

@article{ 10.5120/20420-2720,
author = { Debashis Chakraborty, Debajyoti Ghosh, Piyali Ganguly },
title = { A Dictionary based Efficient Text Compression Technique using Replacement Strategy },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 116 },
number = { 16 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 19-23 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume116/number16/20420-2720/ },
doi = { 10.5120/20420-2720 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:57:17.485829+05:30
%A Debashis Chakraborty
%A Debajyoti Ghosh
%A Piyali Ganguly
%T A Dictionary based Efficient Text Compression Technique using Replacement Strategy
%J International Journal of Computer Applications
%@ 0975-8887
%V 116
%N 16
%P 19-23
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The concept of compression comes from the need to store data using as less space as possible and to ease transfer of data through a channel. The proposed algorithm deals with compression of text files using character replacement technique. For every string of length six, it is compressed by assigning a single character to it, maintaining a dictionary. The dictionary is used to decompress the encoded file. This gives a good compression ratio irrespective of the content of the text file.

References
  1. Debra A. Lelewer and Daniel S. Hirschberg, "Data Compression", Journal ACM Computing Surveys (CSUR), Vol. 19 Issue 3, Sept. 1987, pp. 261-296
  2. Khalid Sayood, "An Introduction to Data Compression", Academic Press, 1996.
  3. David Solomon, "Data Compression: The Complete Reference", Springer Publication, 2000.
  4. Mark Nelson,"The Data Compression Book".
  5. Debashis Chakraborty, Sandipan Bera, Anil Kumar Gupta and Soujit Mondal,, "Efficient Data Compression using Character Replacement through Generated Code", IEEE NCETACS 2011, Shillong, India, March 4-5,2011,pp 334.
  6. Mark Nelson and Jean-Loup Gaily, "The Data Compression Book", Second Edition, M&T Books.
  7. Gonzalo Navarro and Mathieu A Raffinot, "General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text", Proc. CPM'99, LNCS 1645, Pages14-36.
  8. M. Atallah and Y. Genin, "Pattern matching text compression: Algorithmic and empirical results", International Conference on Data Compression, vol II: pp. 349-352, Lausanne, 1996.
  9. Shrusti Porwal, Yashi Chaudhary, Jitendrajoshi, Manish Jain, "Data Compression Methodologies for Lossless Data and Comparision between Algorithms", International Journal of Engineering Science and Innovative Technology (IJESIT), Vol. 2 Issue 2, March 2013.
  10. Timothy C. Bell, "Text Compression", Prentice Hall Publishers, 1990.
  11. J. G. Cleary and I. H. Witten, "Data Compression using adaptive coding and partial string matching", IEEE Trans. Commun. , Vol. COM-32, no. 4, pp. 396-402, Apr. 1984.
  12. Pankaj Kumar Ankur Kumar Varshney, "Double Huffman Coding",International Journal
  13. of Advanced Research in Computer Science and Software Engineering, Volume 2, Issue 8, August 2012.
  14. Nishad PM, R. ManickaChezian, "Enhanced LZW (Lempel-Ziv-Welch) Algorithm by Binary Search with Multiple Dictionary to Reduce Time Complexity for Dictionary Creation in Encoding and Decoding", International Journal of Advanced Research in Computer Science and Engineeering.
  15. Dheemanth H N, "LZW Data Compression", American Journal of Engineering Research (AJER), Volume-03, Issue-02, pp-22-26.
  16. S. Bhattacharjee, J. Bhattacharya, U. Raghavendra, D. Saha, P. Pal Chaudhuri, "A VLSI architecture for cellular automata based parallel data compression", IEEE-2006,Bangalore, India, Jan 03-06.
Index Terms

Computer Science
Information Sciences

Keywords

Lossless Compression Character Replacement Compression Ratio Dictionary

Powered by PhDFocusTM