Abstract

The increase of data usage causes problems in data storage, indirectly making the need for data storage also to increase. One alternative solution that can be done is to compress the file so that the file becomes smaller in size so it saves storage space. The algorithm used in this research is the Run Length Encoding algorithm, the Even Rodeh Code algorithm, and the Variable Length Binary Encoding algorithm which are the types of lossless compression. The algorithm will calculate its performance based on Compression Ratio, Ratio of Compression, Redundancy, Compression Time, and Decompression Time. The file that will be used in the data compression process is the file extension *.txt. This study used homogeneous strings (strings that have the same character) and heterogeneous strings (strings that have different characters) in testing the algorithm. In the compression process with a homogeneous string, the combination of the Run Length Encoding algorithm with the Variable Length Binary Encoding algorithm is better than the combination of the Run Length Encoding algorithm and the Even Rodeh Code algorithm with a Compression Ratio of 18.84% and a decompression time of 0.01295 ms. While the compression process on heterogeneous strings from the combination of the Run Length Encoding algorithm with the Even Rodeh Code algorithm is better than the combination of the Run Length Encoding algorithm with Variable Length Binary Encoding algorithms with Compression Ratio of an average of 52.45% and fewer decompression times of 4.93002 ms

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call