Lossless Compression for Text Document Using Huffman Encoding, Run Length Encoding, and Lempel-Ziv Welch Coding Algorithms
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.9, No. 3)Publication Date: 2020-03-30
Authors : Divya M S; J. Chandrashekhara; Vinay .S; A. Ramadevi;
Page : 100-105
Keywords : Compression; Symbols; Compression Ratio;
Abstract
The main ideology of this concept is offering how text document is compressed by lossless compression schemes. One of the main issue while sending a data, data in the sense image, audio, video, or any legal document from source to the destination is the time taken for uploading, transmitting and downloading the data. If the size of the data is more it takes more time to upload at the sender side and download at the receiver side. They also consumes large amount of storage space. There arises a need to reduce the data size and storage space. Image Compression decreases the amount of data needs to be stored by removing redundant data present in the data. It also reduces the number of bits needed to represent the image, audio, video, text/program document. With these basic concept of image compression, in this concept we are mentioned the techniques to solve lossless compression of text documents.
Other Latest Articles
- Implementation of Curfew Ordinances in Cabanatuan City, Nueva Ecija
- Political Identity: The Bargaining of Center Politic Party Spectrum on the Selection of Indonesian vice President in 2019 General Election (Literature Study: The Candidacy of Jokowi’s vice President Candidate)
- Accentuating on Self-Concept to obviate Suicidality through the novel 13 Reasons why by Jay Asher
- Domestication and Foreignization on the Translation of Yogyakarta Sightseeing Guidebook from Indonesian into English
- Pre-service teacher’s perspectives on the Programme for International Student Assessment for Development (PISA-D): A case of Samtse College of Education
Last modified: 2020-03-23 16:36:34