Implementation of Lossless Compression Algorithms for Text Data Implementation of Lossless Compression Algorithms for Text Data
Main Article Content
Abstract
Compression is useful to reduce the number of bits needed to represent to data. Compressing saves speed file transfer, and decrease costs for storage hardware and network bandwidth. Compression is applied by a program that uses a algorithm to determine how to shrink the size of data. There are number of data compression techniques used and they can be categorized as Lossy and Lossless Compression methods. This paper examines Huffman and arithmetic lossless data compression algorithms and compares their performance. A set of selected algorithms are implemented to examine the performance in compressing text data. An experimental comparison of a number of two lossless data compression algorithms i.e. arithmetic and Huffman is implemented in this paper. In this paper, some of the Lossless data compression methods and their performance are given.
Article Details
Section
Research Article
This is an Open Access article distributed under the terms of the Attribution-Noncommercial 4.0 International License [CC BY-NC 4.0], which requires that reusers give credit to the creator. It allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, for noncommercial purposes only.