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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.