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 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 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

A Comparative Study: Data compression on TANGLISH Natural Language Text

by S Sankar, Dr. S Nagarajan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 38 - Number 3
Year of Publication: 2012
Authors: S Sankar, Dr. S Nagarajan
10.5120/4670-6778

S Sankar, Dr. S Nagarajan . A Comparative Study: Data compression on TANGLISH Natural Language Text. International Journal of Computer Applications. 38, 3 ( January 2012), 33-37. DOI=10.5120/4670-6778

@article{ 10.5120/4670-6778,
author = { S Sankar, Dr. S Nagarajan },
title = { A Comparative Study: Data compression on TANGLISH Natural Language Text },
journal = { International Journal of Computer Applications },
issue_date = { January 2012 },
volume = { 38 },
number = { 3 },
month = { January },
year = { 2012 },
issn = { 0975-8887 },
pages = { 33-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume38/number3/4670-6778/ },
doi = { 10.5120/4670-6778 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:24:37.731696+05:30
%A S Sankar
%A Dr. S Nagarajan
%T A Comparative Study: Data compression on TANGLISH Natural Language Text
%J International Journal of Computer Applications
%@ 0975-8887
%V 38
%N 3
%P 33-37
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this age of information and in the era of distributed on-line and mobile computing, one thing is on the rise at an exponential rate is storage space for information. Growing office automation, digitizing libraries, on-line business transactions, and Meta data storage we need a huge storage space. Since more and more new users become a part of the Internet society the significance of data transmission develops to a great extent as never prior to. If data to be stored or transmitted represented efficiently this can be conquered. Data compression techniques are playing a vital role in representing the information. This paper investigates the use of lossless data compression on the Tanglish language text and compares the performance based upon Huffman coding.

References
  1. Abu Shamim Mohammad Arif, Asif Mahamud, and Rashedul Islam. 2009. An enhanced static data compression scheme of Bengali short message. International Journal of Computer Science and Information Security. Volume 4. No. 1 & 2.
  2. Asher, R.E., and Annamalai, E. 2002. Colloquial Tamil- The Complete Course for Beginners. Routledge Publication. ISBN 0-203-99424-8.
  3. Brent, R. P. 1987. A linear algorithm for data compression. The Australian Computer Journal. Volume 19. No.2.
  4. David R. Mcintyre, and Michael A. Pechura. 1985. Data compression using static Huffman code-decode tables. Communications of the ACM. Volume 28. Issue 6.
  5. Haroon Altarawneh, and Mohammad Altarawneh. 2011. Data Compression Techniques on Text Files: A Comparison Study. International Journal of Computer Applications. Volume 26. No. 5.
  6. Huffman, D. A. 1951. A method for the construction of minimum redundancy codes. Proceedings IRE. Volume 40. Pages 1098-1101.
  7. Kanthimathi, K. 2009. Tamil-English Mixed Language Used in Tamilnadu. The International Journal of Language Society and Culture. Issue 27. ISSN 1327-774X.
  8. Kodituwakku, S.R., and Amarasinghe, U.S. Comparison of lossless data compression algorithms for text data. Indian Journal of Computer Science and Engineering. Volume 1. No. 4. Pages 416-425.
  9. Mamta Sharma. 2010. Compression Using Huffman Coding. International Journal of Computer Science and Network Security. Volume 10. No.5.
  10. Mohammed Rafiul Hassan, and Baikunth Nath, 2005. Data compression using Huffman coding – a novel approach. International Conference on Applied Computing. ISBN: 972-99353-6-X.
  11. Popuri Ramesh Babu, Gonuguntla Rama Swamy, Daruvuri Ravi Kiran, and Devireddy Srinivasa Kumar4. 2009. A novel approach for data compression in E- mail. International Journal of Research and Reviews in Applied Sciences. Volume 1. Issue 1. ISSN: 2076-734X, EISSN: 2076-7366
  12. Sayood. K. 2000. Introduction to Data Compression. Second Edition. Morgan Kaufmann publications.
  13. Viswanath. K. 2002. General Article: Communication Information. Resonance. Volume 7. No. 2. Pages 26-32. DOI: 10.1007/BF02867266.
  14. William Ford, and William Topp. 2002. Data Structure with C++ using STL. Prentice Hall. ISBN: 0-13-085850-1.
  15. Ziv, J. and Lempel, A. 1977. A universal algorithm for data compression. IEEE Transactions on Information Theory. IT-23(3). Pages 337-343.
Index Terms

Computer Science
Information Sciences

Keywords

Lossless Data compression Huffman coding and Tanglish Language

Powered by PhDFocusTM