ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

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:

Authors : ; ; ; ;

Page : 100-105

Keywords : Compression; Symbols; Compression Ratio;

Source : Downloadexternal Find it from : Google Scholarexternal


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.

Last modified: 2020-03-23 16:36:34