Analisa Perbandingan Algoritma Huffman Codes Dan Algoritma Boldi Vigna Codes Dalam Mengkompresi Data Teks

Erni Krisniat Harefa

Abstract


Data compression (data utilization) is a technique to reduce the amount of data size (compression result) of the original data. To solve this problem, it is recommended to compress text files with a suitable algorithm to get optimal results. The analysis is done by comparing the working process of Huffman algorithm and Boldi Vigna algorithm. To compress text files these two algorithms are measured by Compression Ratio, Birate, Space Caving, and Time Compression. the file to be compressed is a text file in TXT format. Text file compression minimizes the storage of a collection of bits in a text file resulting in a smaller size. In the comparison of the two Huffman algorithms with Boldi Vigna, both have a type of lossless compression algorithm, which is a type of compression that can be decompressed and the results obtained from the comparison of the two algorithms, that the Huffman algorithm is superior to Boldi Vigna.

Keywords


Compression; Huffman Algorithm; Boldi Vigna Algorithm; Text Files

Full Text:

PDF

References


D. (David) Salomon, Giovanni. Motta, and David. Bryant, Handbook of data compression. Springer, 2010.

T. J. Pattiasina and M.  Kom, “ANALISA KODE HUFFMAN UNTUK KOMPRESI DATA TEKS.â€

D. Salomon, “Variable-length Codes for Data Compression.â€

N. Astuti Hasibuan, “Analisa Perbandingan Algoritma HuffmanDengan Rice Code Dalam Kompresi File Video,†Nasional Teknologi Informasi dan Komputer), vol. 6, no. 1, 2022, doi: 10.30865/komik.v6i1.5751.

A. Putera and U. Siahaan, “Implementasi Teknik Kompresi Teks Huffman,†2016.

I. Mengyi Pu, “Fundamental Data Compression.â€

J. Jamaluddin, “MAJALAH ILMIAH METHODA Volume 3 Nomor 2, Mei-Agustus 2013 : 41-47 Analisis Perbandingan Kompresi Data dengan Fixed-Length Code, Variable-Length Code dan Algoritma Huffman.â€

S. R. Kodituwakku and U. S. Amarasinghe, “COMPARISON OF LOSSLESS DATA COMPRESSION ALGORITHMS FOR TEXT DATA.â€

P. Kavitha, “A Survey on Lossless and Lossy Data Compression Methods.â€

Giovanni. Motta, Francesco. Rizzo, and J. A. (James A. Storer, Hyperspectral data compression. Springer Science+Business Media, 2006.

U. Jayasankar, V. Thirumal, and D. Ponnurangam, “A survey on data compression techniques: From the perspective of data quality, coding schemes, data type and applications,†Journal of King Saud University - Computer and Information Sciences, vol. 33, no. 2. King Saud bin Abdulaziz University, pp. 119–140, Feb. 01, 2021. doi: 10.1016/j.jksuci.2018.05.006.

D. A. Yansyah, “PERBANDINGAN METODE PUNCTURED ELIAS CODE DAN HUFFMAN PADA KOMPRESI FILE TEXT,†2015.

K. M. Sudrajat, “PERANCANGAN APLIKASI PENGAMANAN FILE TEKS MENGGUNAKAN ALGORITMA EL GAMAL DAN KOMPRESI FILE TEKS MENGGUNAKAN ALGORITMA HUFFMAN,†2019.

Hendrik, “Kombinasi Algoritma Huffman dan Algoritma ROT 13 Dalam Pengamanan File Docx,†2020.

L. Lahmuddin, “Penerapan Algoritma Boldy Vigna Untuk Mengkompresi Pada File Audio Aplikasi Kajian Dan Murottal Islami,†Management of Information System Journal, vol. 1, no. 1.

S. Maria Br Pandia, “Kompresi File Dokumen Menggunakan Algoritma Boldi-Vigna Codes,†Nasional Teknologi Informasi dan Komputer), vol. 6, no. 1, 2022, doi: 10.30865/komik.v6i1.5763.

R. N. Sihombing, “Implementasi Algoritma Multi Group Huffman Dalam Kompresi File Teks Dokumen,†Buletin Ilmiah Informatika Teknologi, vol. 1, no. 3, pp. 76–82, 2023, [Online]. Available: https://ejurnal.amikstiekomsu.ac.id/index.php/BIIT

D. Asdini and D. Putro Utomo, “Analisis Perbandingan Kinerja Algoritma Huffman Dan Algoritma Levenstein Dalam Kompresi File Dokumen Format .RTF,†Nasional Teknologi Informasi dan Komputer), vol. 6, no. 1, 2022, doi: 10.30865/komik.v6i1.5739.

S. Maria Br Pandia, “Kompresi File Dokumen Menggunakan Algoritma Boldi-Vigna Codes,†Nasional Teknologi Informasi dan Komputer), vol. 6, no. 1, 2022, doi: 10.30865/komik.v6i1.5763.

R. Jannah et al., “Jurnal Pendidikan Teknologi Informasi Dan Komputer Penggunaan Algoritma Huffman Dalam Mengkompres Data (File Text),†2023, [Online]. Available: https://journal.grahamitra.id/index.php/petik.




DOI: https://doi.org/10.30865/komik.v7i1.8051

Refbacks

  • There are currently no refbacks.


Copyright (c) 2024 Erni Krisniat Harefa

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.