Comparison of Text Data Compression Using Huffman, Shannon-Fano, Run Length Encoding, and Tunstall Methods

摘要

Data compression is a way to condense a data so that data storage is more efficient and requires only smaller storage space. In addition, with data compression can shorten the time of data exchange. Currently there are many methods that can be used to compress data. And each method has different results and ways. In this paper we will discuss the comparison of data compression using 4 different algorithms, there are using Shannon-Fano Algorithm, Huffman Algorithm, Run Length Encoding Algorithm and the last Tunstall Algorithm.