Kompresi File Dokumen Menggunakan Algoritma Boldi-Vigna Codes
DOI:
https://doi.org/10.30865/komik.v6i1.5763Keywords:
Compression, Document File, Boldi VignaAbstract
At this time, files of the DOCX type are widely used by people among office workers and also among students, a document file is a file that is used to store important files and then stored on a computer. it is also easy to search by typing the attribute or name created by the user. The size of a file that will be stored greatly affects storage space, which if the size of the file stored is large, the storage space must also be large, such as document files, the more content in a document, the larger the document size. The solution to overcome problems like this is to perform data compression techniques. Data compression aims to reduce a file size which can reduce the bit size in each document file, but does not eliminate the information data in it. By compressing, large data will be reduced in size so as to save storage space. In this study the algorithm used is the boldi-vigna codes algorithm, the compression results will benefit and storing document files will be easier.References
J. Pardede, M. M. B, and L. Yudhianto, “Implementasi Algoritma Lzss pada Aplikasi Kompresi dan Dekompresi File Dokumen,†MIND J., vol. 2, no. 1, pp. 68–81, 2018, doi: 10.26760/mindjournal.v2i1.68-81.
R. Y. TANJUNG, “Perancangan aplikasi kompresi file dokumen menggunakan algoritma additive code,†vol. 8, no. 4, pp. 108–113, 2020, doi: 10.30865/jurikom.v8i4.3593.
N. Aftikasyah, “Penerapan Algoritma Yamamoto ’ s Recursive Code Untuk Mengkompresi File Dokumen,†vol. 5, pp. 255–263, 2022, doi: 10.30865/komik.v5i1.3716.
M. Abrar, “Universitas Sumatera Utara,†2021.
S. Hasibuan and R. D. Sianturi, “Penerapan Algoritma Boldy Vigna Untuk Mengkompresi File Gambar Berformat ( BMP ),†vol. 10, pp. 109–118, 2022.
B. A. B. Ii and T. Pustaka, “Implementasi algoritma..., Darwin Chandra, FTI UMN, 2016,†pp. 6–23, 2007.
U. Islam, N. Syarif, and H. Jakarta, “PERBANDINGAN KOMPRESI FILE DATA DENGAN ALGORITMA HUFFMAN , HALF BYTE DAN RUN LENGTH,†vol. 7, no. 2, pp. 1–6, 2014.
D. Oktaviani and I. M. Suartana, “Implementasi Kompresi Data dengan Modifikasi Algoritma Lempel-Ziv-Welch ( LZW ) untuk File Dokumen,†vol. 01, pp. 128–137, 2019.
C. S. Kim and C. C. J. Kuo, Data Compression, vol. 1. 2011.
Y. Darnita, K. Khairunnisyah, and H. Mubarak, “Kompresi Data Teks Dengan Menggunakan Algoritma Sequitur,†Sistemasi, vol. 8, no. 1, p. 104, 2019, doi: 10.32520/stmsi.v8i1.429.
D. Sinurat, “Universitas Sumatera Utara Poliklinik Universitas Sumatera Utara,†J. Pembang. Wil. Kota, vol. 1, no. 3, pp. 82–91, 2018.
D. Pratiwi and T. Zebua, “Analisis Perbandingan Kinerja Algoritma Fixed Length Binary Encoding Dan Algoritma Elias Gamma Code Dalam Kompresi File Teks,†KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 3, no. 1, pp. 424–430, 2019, doi: 10.30865/komik.v3i1.1623.
S. Nainggolan, I. Pendahuluan, and A. A. G. Codes, “Analisa Perbandingan Algoritma Goldbach Codes Dengan Algoritma Dynamic Markov Compression ( Dmc ) Pada Kompresi File Teks Menggunakan,†vol. 6, no. Dmc, pp. 395–399, 2019.
