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
Implementation of Feature Selection Using Correlation Matrix in Python

Ahmad Farhan AlShammari
Random Articles
Reseach Article

Lossless Text Compression using Dictionaries

by Umesh S. Bhadade, Prof. A.I. Trivedi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 13 - Number 8
Year of Publication: 2011
Authors: Umesh S. Bhadade, Prof. A.I. Trivedi
10.5120/1799-1767

Umesh S. Bhadade, Prof. A.I. Trivedi . Lossless Text Compression using Dictionaries. International Journal of Computer Applications. 13, 8 ( January 2011), 27-34. DOI=10.5120/1799-1767

@article{ 10.5120/1799-1767,
author = { Umesh S. Bhadade, Prof. A.I. Trivedi },
title = { Lossless Text Compression using Dictionaries },
journal = { International Journal of Computer Applications },
issue_date = { January 2011 },
volume = { 13 },
number = { 8 },
month = { January },
year = { 2011 },
issn = { 0975-8887 },
pages = { 27-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume13/number8/1799-1767/ },
doi = { 10.5120/1799-1767 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:02:13.170815+05:30
%A Umesh S. Bhadade
%A Prof. A.I. Trivedi
%T Lossless Text Compression using Dictionaries
%J International Journal of Computer Applications
%@ 0975-8887
%V 13
%N 8
%P 27-34
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Compression is used just about everywhere. Reduction of both compression ratio and retrieval of data from large collection is important in today’s era. We propose a pre-compression technique that can be applied to text files. The output of our technique can be further applied to standard compression techniques available, such as arithmetic coding and BZIP2, which yields in better compression ratio. The algorithm suggested here uses the dynamic dictionary created at run-time and is also suitable for searching the phrases from the compressed file.

References
  1. Huffman D. A., “A method for the construction of minimum-redundancy codes” Proc. Inst. Radio Eng. 40(9):1098–1101, 1952.
  2. Ziv J. and Lempel A., ‘A universal algorithm for sequential data compression,’ IEEE Transactions on Information Theory, 23(3):337–343, 1977.
  3. Ziv J. and Lempel A., ‘Compression of individual sequences via variable-rate coding,’ IEEE Transactions on Information Theory, 24(5):530–536, 1978.
  4. Welch, T.A. ‘A Technique for High-Performance Data Compression.’ IEEE Computer 17, 6(June 1984), pp. 8-19.
  5. Rissanen J. J. and Langdon G. G., Jr., “Arithmetic Coding,” IBM J. Res. Develop. 23, 149-162 (1979).
  6. J.Rissanen J. J., “Arithmetic Coding as Number Representations,” Acta Polyt. Scandinavica Math. 34, 44-51 (December 1979).
  7. Burrows, M. & Wheeler, D. ‘A block-sorting lossless data compression algorithm’, Technical report, Digital Equipment Corporation, 1994.
  8. Bentley J.L., Sleator D.D., Tarjan R.E., and Wei V.K.. A locally adaptive data compression algorithm. Communications of the ACM, Vol. 29, No. 4, April 1986, pp. 320–330.
  9. Amis A. and Benson G., Efficient two-dimensional compressed matching. In J. Storer and M. Cohn, editors, Proceedings of the IEEE Data Compression Conference, pages 279-288, Los Alamitos, CA, Mar. 1992. IEEE Computer Society Press.
  10. Tucker An B. Jr.’The Computer Science and Engineering Handbook’ Second Edition, Chapman & Hall/CRC, 2004
  11. Mark Nelson, “Data Compression with Burrows Wheeler Transform”, Dr. Dobbs Journal, September 1996.
Index Terms

Computer Science
Information Sciences

Keywords

Text Compression Dynamic dictionary

Powered by PhDFocusTM