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

• 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.
• Asher, R.E., and Annamalai, E. 2002. Colloquial Tamil- The Complete Course for Beginners. Routledge Publication. ISBN 0-203-99424-8.
• Brent, R. P. 1987. A linear algorithm for data compression. The Australian Computer Journal. Volume 19. No.2.
• David R. Mcintyre, and Michael A. Pechura. 1985. Data compression using static Huffman code-decode tables. Communications of the ACM. Volume 28. Issue 6.
• Haroon Altarawneh, and Mohammad Altarawneh. 2011. Data Compression Techniques on Text Files: A Comparison Study. International Journal of Computer Applications. Volume 26. No. 5.
• Huffman, D. A. 1951. A method for the construction of minimum redundancy codes. Proceedings IRE. Volume 40. Pages 1098-1101.
• Kanthimathi, K. 2009. Tamil-English Mixed Language Used in Tamilnadu. The International Journal of Language Society and Culture. Issue 27. ISSN 1327-774X.
• 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.
• Mamta Sharma. 2010. Compression Using Huffman Coding. International Journal of Computer Science and Network Security. Volume 10. No.5.
• 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.
• 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
• Sayood. K. 2000. Introduction to Data Compression. Second Edition. Morgan Kaufmann publications.
• Viswanath. K. 2002. General Article: Communication Information. Resonance. Volume 7. No. 2. Pages 26-32. DOI: 10.1007/BF02867266.
• William Ford, and William Topp. 2002. Data Structure with C++ using STL. Prentice Hall. ISBN: 0-13-085850-1.
• Ziv, J. and Lempel, A. 1977. A universal algorithm for data compression. IEEE Transactions on Information Theory. IT-23(3). Pages 337-343.