Open AccessReview on Lossless Compression Techniques
Author(s) -
Harika Devi Kotha,
Madhumitha Tummanapally,
Vikash Kumar Upadhyay
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1228/1/012007
Subject(s) - huffman coding , lossless compression , computer science , arithmetic coding , data compression , coding (social sciences) , adaptive coding , context adaptive binary arithmetic coding , computer hardware , tunstall coding , arithmetic , real time computing , algorithm , mathematics , statistics
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.