Review on Lossless Compression Techniques
Authors:
Open Access
- 1 May 2019
- conference paper
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1228 (1) , 012007
Abstract
In the present world data compression is used in every field. Through data compression the bits required to represent a message will be reduced. By compressing the given data, we can save the storage capacity, files are transferred at high speed, storage hardware is decreased so that its cost is also decreased, and storage bandwidth is decreased. There are many methods to compress the data. But in this paper, we are discussing about Huffman coding and Arithmetic coding. For various input streams we are comparing adaptive Huffman coding and arithmetic coding and we will observe which technique will be more efficient to compress the data.Keywords
This publication has 5 references indexed in Scilit:
- A novel data compression approach to reduce string size for PLCC based DAS2015
- Design of Modified Adaptive Huffman Data Compression Algorithm for Wireless Sensor NetworkJournal of Computer Science, 2009
- Optimal Selective Huffman Coding for Test-Data CompressionIEEE Transactions on Computers, 2007
- Huffman Coding Method Based on Number Character2007
- Data Compression Using Adaptive Coding and Partial String MatchingIEEE Transactions on Communications, 1984