Analisa Perbandingan Algoritma Unary Code Dan Algoritma Prefix Code Untuk Kompresi File PDF
-
Apni Radiah Radiah
*
Universitas Budi Darma, Medan,
Indonesia
(*) Corresponding Author
Abstract
A pdf file (Portable Document Format) is a type of document or file format for digital document exchange purposes. Problems with pdf files often occur when we send files with a large capacity so that the process of sending files is wasteful and it will take a long time in the process of sending pdf files. In overcoming this problem, you have to do a compression technique first so that the pdf file saves on sending files. After carrying out the compression process, you will get a smaller file than before. And the goal is to save storage space and also speed up the shipping process.In the compression process, the Prefix Code Algorithm has better compression results than the Unary Code Algorithm, namely the Prefix Code Algorithm obtains a total value of 5.420% while the Unary Code Algorithm obtains a total value of 5.220% in compressing Pdf files. The Prefix Code algorithm obtains greater results compared to the Unary Code algorithm. So the conclusion is that the Prefix Algorithm is better than the Unary Code Algorithm for compressing Pdf files.
References
F. E. Naibaho, "Implementasi Algoritma J-Bit Encoding Pada Kompresi File Pdf," Jurnal Sistem Komputer dan Informasi (JSON), Vols. 1, Nomor 3, Mei 2020, no. 2685-998x, pp. 278-283, 2020.
D. P. U. Soumi Rohmah Saragih, "Penerapan Algoritma Prefix Code Dalam Kompresi Data Teks," Komik (Konfrensi Nasional Teknologi Informasi dan Komputer), Vols. 4, Nomor 1, Oktober 2020, no. 2597-4645, pp. 249-252, 2020.
S. A. Muhammad Alfarizi, "Penerapan Algoritma Prefix Code Dalam Kompresi File Vidio," KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer), Vols. 4, Nomor 1, Oktober 2020, no. 2597-4645, pp. 232-235, 2020.
M. Sitorus, "Penerapan Algoritma Unary Coding Pada Aplikasi Kompresi Short Message Service (SMS)," Journal of Computer System and Informatics (JoSYC), Vols. 1, No 2, Februari, no. 2714-8912, pp. 39-45, 2020.
W. A. Harahap, "Studi Komparasi Kinerja Algoritma Goldbach G1 Code Dan Algoritma Unary Codes Dalam Kompresi Teks," 2017.
Mawar, "Perancangan Aplikasi Kompresi File Pdf Dengan Menerapkan Algoritma Punctured Elias Codes," Jurnal Informasi dan Teknologi Ilmiah (INTI), Vols. 7, No 3, Juni 2020, no. 2301-9425 (Media Cetak), pp. 217-223, 2020.
K. H. M. Yulia Darnita, "Kompresi Data Teks Dengan Menggunakan Algoritma Sequitur," Jurnal SISTEMASI, Vols. 8, Nomor 1 Januari 2019 : 104 - 113, 2019.
S. Kaur, "Entropy Coding and Different Coding Techniques," Journal of Network Communications and Emerging Technologies (JNCET), vol. 6, no. 5, May 2016.
G. M. David Salomon, Handbook of Data Compression 5th,, 2019.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Analisa Perbandingan Algoritma Unary Code Dan Algoritma Prefix Code Untuk Kompresi File PDF
Pages: 119-127
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
