Application of Huffman Algorithm and Unary Codes for Text File Compression

Authors

  • Bayu Angga Wijaya Universitas Prima Indonesia, Indonesia
  • Sarwando Siboro Universitas Prima Indonesia, Indonesia
  • Mahendra Brutu Universitas Prima Indonesia, Indonesia
  • Yelita Kristiani Lase Universitas Prima Indonesia, Indonesia

DOI:

10.33395/sinkron.v7i3.11567

Keywords:

Compression; Huffman; Unary Codes; Java; Algorithm;

Abstract

Technique in carrying out data compression is an important point in technological developments. With compression in data in the form of text can include many uses, including for data transfer, copying and for backing up data. From its uses, this aspect is important for data security. There are many compression techniques on the data, including using huffman algorithms and unary code. One of its applications will be implemented on a text data that is widely used by digital actors in storing important data. The data must not be known by unauthorized parties in accessing the data. Therefore, huffman algorithms and unary code can solve this problem. By compressing the selected data also encrypts it as an extra security. The Huffman algorithm is a lossless compression algorithm or a technique that does not change the original data, by converting the unit of data content into bits. So this algorithm is widely used in the compression process. The Unary Codes algorithm is also a lossless compression technique that is generally used by combining several modification techniques. In this unary codes algorithm, each symbol in the string will be searched for its frequency. Then sorted from the last order (descending). The use of these two text data compression techniques results in a file size that is smaller than the original but can be returned to the original data

GS Cited Analysis

Downloads

Download data is not yet available.

References

Chulkamdi, M., Sholeh Pramono, and Erni Yudaningtyas. 2015. “Kompresi Teks Menggunakan Algoritma Huffman Dan Md5 Pada Instant Messaging Smartphone Android.” Jurnal EECCIS 9(1): 103–8.

Fitri Angelina, Siahaan. 2018. “Mengkompresi Teks Terenkripsi El Gamal.” 2(1): 26–34.

Kharisma Mahesa, Karpen. 2018. “Rancang Bangun Aplikasi Kompresi Dan Dekompresi Pada Citra Digital Menggunakan Metode Huffman.” Jurnal Processor 12(1): 948–63.

http://ejournal.stikom-db.ac.id/index.php/processor/article/view/367.

Lamsah, and Dito Putro Utomo. 2020. “Penerapan Algoritma Stout Codes Untuk Kompresi Record Pada Databade Di Aplikasi Kumpulan Novel.” KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) 4(1): 311–14.

Meisiria Sitorus. 2020. “Penerapan Algoritma Golomb Pada Aplikasi Kompresi Short Message Service (SMS).” Journal of Computer System and Informatics … 1(4): 159–65. https://ejurnal.seminar-id.com/index.php/josyc/article/view/73.

Mhd. Rajani, Pane. 2017. “Perancangan Aplikasi Kompresi Menggunakan Metode Shannon Fano Dan Unary Coding Pada File Teks.” Informasi dan Teknologi Ilmiah (INTI) 12(September): 306–11.

Michael, Simangunsong. 2020. “Perbandingan Algoritma Elias Delta Code Dan Unary Coding Dalam Kompresi Citra Forensik.” Resolusi: Rekayasa Teknik Informatika dan … 1(1): 18–26. http://djournals.com/resolusi/article/view/9.

Rahmat, Limbong. 2020. “Implementasi Algoritma Unary Coding Pada Kompresi Citra Ultrasonografi.” Pelita Informatika: Informasi dan … 8: 367–70. http://ejurnal.stmik-budidarma.ac.id/index.php/pelita/article/view/2424.

Siahaan, Andysah Putera Utama. 2016. “JURNAL INFORMATIKA Vol. 10, No. 2, Jul 2016 IMPLEMENTASI TEKNIK KOMPRESI TEKS HUFFMAN.” J. Informatika 10(2): 1251–61.

Yonathan, Febri Dwinata, Helfi Nasution, and Heri Priyanto. 2021. “Aplikasi Pengaman Dokumen Digital Menggunakan Algoritma Kriptografi Hybrid Dan Algoritma Kompresi Huffman.” Jurnal Edukasi dan Penelitian Informatika (JEPIN) 7(2): 181.

Wijaya, B. A., Nugraha, A., Juandry, J., Okinawa, J. and Kinoto, J. (2020) “Film Recommendation System with Social-Union Algorithm: Film Recommendation System with Social-Union Algorithm”, Jurnal Mantik, 4(2), pp. 1278-1284. doi: 10.35335/mantik.Vol4.2020.932.pp1278-1284.

Wijaya, B. A., Manalu, A. J. . ., Tarigan, B. A. . . and Silitonga, L. S. . . (2021) “Steganography Text Message Using LSB and DCT Methods”, Jurnal Mantik, 5(3), pp. 1825-1832. Available at: https://iocscience.org/ejournal/index.php/mantik/article/view/1767 (Accessed: 17July2022).

Downloads


Crossmark Updates

How to Cite

Wijaya, B. A., Siboro, S. ., Brutu, M., & Lase, Y. K. (2022). Application of Huffman Algorithm and Unary Codes for Text File Compression. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 1000-1007. https://doi.org/10.33395/sinkron.v7i3.11567