Performance Analysis of Lossless Type of Compression Algorithm in Compression Data

Surya Darma Nasution(1*), Imam Saputra(2),

(1) Universitas Budi Darma
(2) Universitas Budi Darma
(*) Corresponding Author


As a result of processing data in the form of documents too often, document files accumulate on storage media and make the storage media lack free space. One solution that can prevent this is data compression. In this study, we will try to analyze the performance of lossless algorithms, some of which are: Goldbach's Algorithm, Fibonacci's Algorithm, Rice Codes Algorithm, Additive Codes, and Yamamoto's Recursive Codes Algorithm. The main reason why a comparison is needed is to see which algorithm is the best, it is worth doing as a basis for making applications that can compress data because application users want the best results for them, and in this case, are those that can compress files and produce the smallest size compared to other algorithms. The data to be compressed is text data. The results obtained from the test are the Goldbach Codes and Fibonacci Codes algorithms are superior to the third algorithm and several times have the same results, namely compression ratios of 60% to 68% and space savings ranging from 32% to 40%.

Full Text:



S. D. Nasution and Mesran, “Goldbach Codes Algorithm for Text Compression,” IJournals Int. J. Softw. Hardw. Res. Eng, vol. 4, no. December, pp. 43–46, 2016.

J. Martina and B. Panjaitan, “Penerapan Algoritma Fibonacci Codes Pada Kompresi Aplikasi Audio Mp3 Berbasis Dekstop,” vol. 1, no. 1, pp. 27–33, 2021.

M. A. Latif, S. D. Nasution, and Pristiwanto, “Analisa Perbandingan Algoritma Rice Codes Dengan Algoritma Goldbach Codes Pada Kompresi File Text Menggunakan Metode Exponential,” Maj. Ilm. INTI (Informasi dan Teknol. Ilmiah), vol. 13, no. 1, pp. 28–33, 2018.

E. Hariska, “Perancangan Aplikasi Kompresi File Gambar Menggunakan Algoritma Additive Code,” vol. 5, pp. 193–202, 2021, doi: 10.30865/komik.v5i1.3671.

N. Aftikasyah, “Penerapan Algoritma Yamamoto ’ s Recursive Code Untuk Mengkompresi File Dokumen,” vol. 5, pp. 255–263, 2022, doi: 10.30865/komik.v5i1.3716.

D. Salomon, Data Compression The Complete Reference FourthEdition, vol. 53, no. 9. Springer, 2007.

M. Yogie, “Penerapan Algoritma Goldbach Codes Pada Kompresi File Gambar Terenkripsi Vigenere Cihper,” J. Pelita Inform., vol. 7, pp. 81–85, 2018.

S. D. Nasution, G. L. Ginting, M. Syahrizal, and R. Rahim, “Data Security Using Vigenere Cipher and Goldbach Codes Algorithm,” Int. J. Eng. Res. Technol., vol. 6, no. 01, pp. 360–363, 2017.

D. Salomon and G. Motta, HandBook Of Data Compression. Springer, 2010.

I. Hasan, Tommy, and N. Irsa Syahputri, “Analisis Parameter Kompresi Algoritma Elias Omega Code dan Fibonacci Code Pada File Digital,” Algoritm. J. Ilmu Komput. dan Inform., vol. 6341, no. April, p. 1, 2021.

B. Ramadhana, “Implementasi Kombinasi Algoritma Fibonacci Codes Dan Levenstein Codes Untuk Kompresi File Pdf,” vol. 8, no. 2, pp. 67–71, 2021.

F. R. Kesuma, “Implementasi Kombinasi Algoritma Elias Omega Codes Dan Golomb Rice Dengan Teknik High Compress Pada File Teks,” Inf. dan Teknol. Ilm., vol. 8, no. 2, pp. 76–81, 2021.

R. Y. Tanjung, “Perancangan aplikasi kompresi file dokumen menggunakan algoritma additive code,” Universitas Budidarma Medan, 2020.



  • There are currently no refbacks.

Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: