We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

An Efficient Text Compression for Massive Volume of Data

by M.Baritha Begum, Dr.Y.Venkataramani
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 21 - Number 5
Year of Publication: 2011
Authors: M.Baritha Begum, Dr.Y.Venkataramani
10.5120/2510-3399

M.Baritha Begum, Dr.Y.Venkataramani . An Efficient Text Compression for Massive Volume of Data. International Journal of Computer Applications. 21, 5 ( May 2011), 5-9. DOI=10.5120/2510-3399

@article{ 10.5120/2510-3399,
author = { M.Baritha Begum, Dr.Y.Venkataramani },
title = { An Efficient Text Compression for Massive Volume of Data },
journal = { International Journal of Computer Applications },
issue_date = { May 2011 },
volume = { 21 },
number = { 5 },
month = { May },
year = { 2011 },
issn = { 0975-8887 },
pages = { 5-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume21/number5/2510-3399/ },
doi = { 10.5120/2510-3399 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:08:05.289451+05:30
%A M.Baritha Begum
%A Dr.Y.Venkataramani
%T An Efficient Text Compression for Massive Volume of Data
%J International Journal of Computer Applications
%@ 0975-8887
%V 21
%N 5
%P 5-9
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

To propose a new text compression technique for ASCII texts for the purpose of obtaining good performance on various document sizes. This algorithm is composed of two stages. In the first stage, the input strings are converted into the dictionary based compression. In the second stage, the redundancy of the dictionary based compression is reduced by Burrows wheeler transforms and Run length coding. The algorithm has good compression ratio and reduces bit rate to execute the text with increase in the speed.

References
  1. G.Hold and T.R Marshall, Data compression, John Wiley, New York 1991.
  2. Jirapond Tadrat and Veera Boonjing, 2008”An Experiment study on Transformation for Compression using stop lists and Frequent words” IEEE Transactions on information technology.
  3. Data compression: the complete reference By David Salomon
  4. A.carus, A.Mesut, 2010,”Fast text compression using Multiplies dictionaries”, Information technology journal 9(5) 1013-1021.
  5. M. Burrows and D. J. Wheeler. “A Block-sorting Lossless Data Compression Algorithm”, SRC Research Report 124, Digital Systems Research Center.
  6. J.L. Bentley, D.D. Sleator, R.E. Tarjan, and V.K. Wei, “ A Locally Adaptive Data Compression Scheme”, Proc. 22nd Allerton Conf. On Communication, Control, and Computing, pp. 233-242, Monticello, IL, October 1984, University of Illinois
  7. J.L. Bentley, D.D. Sleator, R.E. Tarjan, and V.K. Wei, “A Locally Adaptive Data Compression Scheme”, Commun. Ass. Comp. Mach., 29:pp. 233-242, April 1986.
  8. R.G. Gallager. “Variations on a theme by Huffman”, IEEE Trans. Information Theory, IT-24(6), pp.668-674, Nov, 1978
  9. D.A.Huffman. “A Method for the Construction of Minimum Redundancy Codes”, Proc. IRE, 40(9), pp.1098-1101, 1952
  10. Nelson C. Francisco, Nuno M. M. Rodrigues, Eduardo A. B. da Silva, Murilo Bresciani de Carvalho, Sergio M. M. de Faria, , October 2010 “Scanned Compound Document Encoding Using Multiscale Recurrent Patterns” IEEE transactions on image processing, vol. 19, no. 10.
  11. Umesh S. Bhadade Prof. A.I. Trivedi, January 2011 “Lossless Text Compression using Dictionaries”, International Journal of Computer Applications (0975 – 8887) Volume 13– No.8.
  12. Compression test results, corpus.canterbury.ac.nz/
Index Terms

Computer Science
Information Sciences

Keywords

Dictionary Based Encoding (DBE) Burrows-Wheeler Transform (BWT) Run Length Encoding (RLE).

Powered by PhDFocusTM