Implementation of Huffman Code Algorithm for Message Compression and Decompression

Authors

  • Akbar Serdano Universitas Islam Negeri Sumatera Utara
  • Chairunnisa Azzahra Universitas Islam Negeri Sumatera Utara
  • Darus Alpamah Universitas Islam Negeri Sumatera Utara
  • Ilham Fajar Batubara Universitas Islam Negeri Sumatera Utara
  • Mohd. Wildan Qasthari Universitas Islam Negeri Sumatera Utara

DOI:

https://doi.org/10.55537/cosie.v3i4.949

Keywords:

Compression, Decompression, Huffman

Abstract

Advances in information technology have brought significant changes in the way we transmit data. Data compression is a long-developed method that allows us to reduce the size of a file or message without losing important data in the file. By using the Huffman Code algorithm the size of the message in compression can save or reduce the size by approximately 70%. Huffman is a lossless compression algorithm, so when decompressed it will produce data that is identical to the original data before compression. The Huffman Code algorithm is implemented into the program to test the data used. The data used for this research comes from short message text.

Downloads

Download data is not yet available.

References

T. J. Pattiasina, “ANALISA KODE HUFFMAN UNTUK KOMPRESI DATA TEKS,” TEKNIKA, vol. 1, no. 1, pp. 1–12, 2012, [Online]. Available: https://ejournal.ikado.ac.id/index.php/teknika/article/view/1/

K. M. Prayoga, Eka; Suryaningrum, “IMPLEMENTASI ALGORITMA HUFFMAN DAN RUN LENGTH ENCODING PADA APLIKASI KOMPRESI BERBASIS WEB,” J. Ilm. Teknol. Inf. Terap., vol. 4, no. 2, pp. 92–101, 2018.

K. K. Mahesa, “Rancang Bangun Aplikasi Kompresi Dan Dekompresi Pada Citra Digital Menggunakan Metode Huffman,” PROCESSOR, vol. 12, no. 1, pp. 997–1012, 2017.

H. Dewi, Kuni Yustika; Nurwasito, “Implementasi Algoritma Huffman untuk Kompresi Gambar pada Jaringan 6LoWPAN,” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 6, no. 4, pp. 2008–2017, 2022.

T. Sodikin, Luthfia; Putri, Tineke Fatma; Hidayat, “Analisa Kompresi File Teks Menggunakan Algortima Huffman,” J. ICTEE, vol. 3, no. 1, pp. 10–19, 2022.

A. Pahdi, “Algoritma Huffman Dalam Pemampatan Dan Enksripsi Data,” Indones. J. Netw. Secur., vol. 6, no. 3, pp. 1–7, 2017.

S. dkk Siboro, “Application of Huffman algorithm and Unary Codes for Text File Compression,” Sink. J. dan Penelit. Tek. Inform., vol. 7, no. 3, pp. 1000–1007, 2022.

R. Arshad, A. Saleem, dan D. Khan, “Performance comparison of Huffman Coding and Double Huffman Coding,” in 2016 6th International Conference on Innovative Computing Technology, INTECH 2016, 2017, hal. 361–364. doi: 10.1109/INTECH.2016.7845058.

M. U. Hassan, M. H. Rehmani, dan J. Chen, Huff-DP: Huffman Coding based Differential Privacy Mechanism for Real-Time Data. 2023. doi: 10.48550/arXiv.2301.10395.

S. More, V. Sanivarapu, Y. Sharma, V. M. Thigale, dan M. Suguna, “Enhancing Data Compression: A Dynamic Programming Approach with Huffman Coding and Burrows-Wheeler Transform,” in 2nd International Conference on Automation, Computing and Renewable Systems, ICACRS 2023 - Proceedings, 2023, hal. 82–88. doi: 10.1109/ICACRS58579.2023.10404627.

Downloads

Published

30-10-2024

How to Cite

Serdano, A., Azzahra, . C., Alpamah, D., Batubara, I. F., & Qasthari, M. W. (2024). Implementation of Huffman Code Algorithm for Message Compression and Decompression. Journal of Computer Science and Informatics Engineering , 3(4), 161–169. https://doi.org/10.55537/cosie.v3i4.949

Issue

Section

Articles