Analisa Perbandingan Algoritma Taboo Codes Dan Algoritma Yamamoto’s Recursive Code Untuk Kompresi File Teks Menggunakan Metode Exponential

 (*)Arianti Rhamadani Mail (Universitas Budi Darma, Medan, Indonesia)

(*) Corresponding Author

Abstract

In the current digital era, the use of data compression technology is very important because the use of data in electronic form is faster to exchange information. Large file sizes require a lot of storage space. Rich text format (rtf) text files have a large size compared to other types of text files with extensions. Because the file size with the extension .rtf is too large, the data transmission process takes a long time. One of the techniques required for this problem is to perform compression. Compression is the process of resizing data to a smaller size. The algorithms used in this study are the Taboo Codes and Yamamoto’s Recursive Code algorithms, each of which has advantages and disadvantages. After the two algorithms are compressed, then a comparison of the two algorithms is carried out using the Exponential method. The exponential comparison method is one of the methods used to determine the priority order of decision alternatives with several criteria. The final result of the comparison process with the exponential method is 7,203, which is Yamamoto’s Recursive Code algorithm. So that the algorithm becomes the fastest and most effective algorithm in compressing text files, this is because the smaller the total value obtained, the less effort is made by the algorithm in compression.

Keywords


Compression; Rtf; Taboo Codes; Yamamoto’s Recursive Code; Exponential

Full Text:

PDF


Article Metrics

Abstract view : 322 times
PDF - 172 times

References

R. I. Borman and H. Fauzi, “Dalam Sistem Pendukung Keputusan Penerima Beasiswa,” CESS J. Comput. Eng. Syst. Sci., vol. 3, no. 1, pp. 17–22, 2018.

M. A. Latif, S. D. Nasution, and P. 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, [Online]. Available: http://ejurnal.stmik-budidarma.ac.id/index.php/inti/article/view/639.

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

S. Simanjuntak, “Implementasi Metode Taboo Code Untuk Kompresi File Video,” Explorer (Hayward)., vol. 2, no. 1, pp. 32–38, 2022, doi: 10.47065/explorer.v2i1.156.

S. B. Ginting et al., “Perbandingan Algoritma Yamamoto ’ s Recursive Code Dan Additive Code Dalam Kompresi File Video,” vol. 5, 2021, doi: 10.30865/komik.v5i1.3819.

W. T. W. Simanjuntak, “Analisa Perbandingan Algortima Prediction By Partial Matching Dengan Sequitur Pada Kompresi File Teks,” vol. 5, pp. 221–227, 2021, doi: 10.30865/komik.v5i1.3675.

M. R. Irliansyah, S. D. Nasution, and K. Ulfa, “Penerapan Metode Deflate Dan Algoritma Goldbach Codes Dalam Kompresi File Teks,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 1, no. 1, pp. 186–189, 2017.

A. Apijuddin Kompresi and A. S. Codes, “Perancangan Aplikasi Kompresi File Teks Menggunakan Algoritma Stout Codes,” vol. 9, pp. 183–188, 2021.

D. Salomon and G. Motta, Handbook of Data Compression 5th, vol. 53, no. 9. 2019.

L. V Simanjuntak, “Perbandingan Algoritma Elias Delta Code dengan Levenstein Untuk Kompresi File Teks,” J. Comput. Syst. …, vol. 1, no. 3, pp. 184–190, 2020, [Online]. Available: https://ejurnal.seminar-id.com/index.php/josyc/article/view/168.

J. P. Informatika et al., “Analisa Perbadingan Algoritma Goldbach Codes Dengan Algoritma Sequitur Pada Kompresi File Text,” vol. 18, pp. 354–357, 2019.

. Nainggolan, “Analisa Perbandingan Algoritma Goldbach Codes Dengan Algoritma Dynamic Markov Compression (DMC) Pada Kompresi File Teks Menggunakan Metode Eksponensial,” Maj. Ilm. INTI, vol. 6, no. 3, pp. 395–399, 2019.

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Analisa Perbandingan Algoritma Taboo Codes Dan Algoritma Yamamoto’s Recursive Code Untuk Kompresi File Teks Menggunakan Metode Exponential

Refbacks

  • There are currently no refbacks.


Copyright (c) 2022 Arianti Rhamadani

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.


KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)
P3M STMIK Budi Darma
Sekretariat Jln. Sisingamangaraja No. 338 Telp 061-7875998
email: komik@univ-bd.ac.id, komik.budidarma@gmail.com

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.