Analisa Perbandingan Algoritma Shannon Fano Dan Algoritma Stout Code Pada Kompresi File Teks

Dito  Putro Utomo; Abdul  Karim; Muhammad  Syahrizal

doi:10.47065/mis.v4i2.2568

Dito Putro Utomo Politeknik Negeri Medan, Indonesia
Abdul Karim Universitas Labuhanbatu, Indonesia
Muhammad Syahrizal Politeknik Cendana, Indonesia

DOI: https://doi.org/10.47065/mis.v4i2.2568

Keywords: Kompresi; Algoritma Shannon Fano; Algoritma Stout Code; File Teks

Abstract

The rapid development of technology today attracts a lot of attention from the wider community. The dynamic development of computers is accompanied by the ability to get information very quickly. Data compression is a technique to reduce the amount of data in the original data. Data compression is usually applied to computer machines. This happens because each symbol displayed on the computer has a different bit value. The large size of text files will be a problem for storage space. Because the need for text files is very important, we tend to collect data in the form of text files, and often without realizing it, we store it in large sizes. This causes the need for storage media to be large. To overcome this problem, text files that have a larger size are used by compressing text files. Large data will be compressed into a small size, which will reduce storage. After applying the comparison of the Shannon Fano Algorithm and the Stout Code algorithm, compressing the text file has proven that the text file has been successfully compressed. After performing the text file compression process, the author can conclude that the Shannon Fano algorithm is better at performing the compression process.

References

A. P. U. Siahaan, “Implementasi Algoritma Run Length Encoding (RLE) pada Kompresi File Teks,” J. Tek. Inform., vol. 8, no. 2, pp. 45–52, 2021, doi: 10.15408/jti.v8i2.20456.

M. Safii, D. Hartama, and Solikhun, “Perbandingan Algoritma Huffman dan LZW dalam Kompresi File Teks,” J. Sist. Komput. dan Inform., vol. 3, no. 1, pp. 22–30, 2021, doi: 10.30865/json.v3i1.2765.

P. Novak and L. Svoboda, “Modern Approaches in Lossless Data Compression,” Inf. Sci. (Ny)., vol. 650, pp. 120–135, 2025, doi: 10.1016/j.ins.2024.119876.

A. Fauzi and B. Santoso, “Compression Performance Evaluation for IoT Data,” IEEE Access, vol. 11, pp. 99887–99902, 2023, doi: 10.1109/ACCESS.2023.3322110.

C. Liu and M. Zhao, “Entropy Coding Techniques in Modern Systems,” IEEE Syst. J., vol. 18, no. 2, pp. 1120–1130, 2024, doi: 10.1109/JSYST.2023.3298765.

D. Kim and J. Park, “Optimization of Text Compression Algorithms,” Futur. Gener. Comput. Syst., vol. 137, pp. 89–101, 2023, doi: 10.1016/j.future.2022.11.012.

N. Tran and P. D. Anh, “Efficient Lossless Compression Algorithms for Text Data,” Multimed. Tools Appl., vol. 80, no. 21, pp. 32145–32160, 2021, doi: 10.1007/s11042-020-10456-3.

H. Tanaka and Y. Nakamura, “Entropy-Based Compression in Communication Systems,” IEEE Trans. Commun., vol. 72, no. 4, pp. 1789–1800, 2024, doi: 10.1109/TCOMM.2024.3344556.

A. Fauzan and B. Santoso, “Analisis Kompresi File Teks Menggunakan Algoritma Run Length Encoding (RLE),” J. Inform. Ekon. Bisnis, vol. 5, no. 2, pp. 55–62, 2023, doi: 10.37034/infeb.v5i2.210.

I. Gunawan and R. Syahputra, “Implementasi Algoritma Lempel Ziv Welch (LZW) untuk Kompresi File Teks,” J. Tek. Inform. UNIKA St. Thomas, vol. 7, no. 1, pp. 34–40, 2022, doi: 10.17605/jti.v7i1.1042.

A. Al-Ali and M. R. Razalli, “A Review of Data Compression Techniques for Text Data,” J. King Saud Univ. – Comput. Inf. Sci., vol. 34, no. 6, pp. 3102–3115, 2022, doi: 10.1016/j.jksuci.2021.02.009.

K. Brown and M. Johnso, “Data Compression in Cloud Computing,” J. Cloud Comput., vol. 11, no. 1, pp. 45–60, 2022, doi: 10.1186/s13677-022-00298-1.

A. A. Hrp, “Penerapan Algoritma Stout Codes pada Kompresi File Audio Aplikasi Kumpulan Ceramah Ustadz KH. Zainuddin MZ,” J. Glob. Technol. Comput., vol. 3, no. 1, pp. 1–10, 2023, doi: 10.47065/jogtc.v3i1.4683.

S. S. Sakinah, A. I. Hadiana, and F. Kasyidi, “Pengamanan File Dokumen dengan Kombinasi Algoritma ElGamal dan Teknik Kompresi Algoritma Stout Codes,” J. Inform. Teknol. dan Sains, vol. 6, no. 3, pp. 443–454, 2024, doi: 10.51401/jinteks.v6i3.4315.

D. Hartama, Solikhun, and M. Safii, “Implementasi Algoritma Shannon-Fano dan Huffman dalam Kompresi File Teks,” J. Media Inform. Budidarma, vol. 6, no. 3, pp. 1387–1394, 2022, doi: 10.30865/mib.v6i3.4313.

M. Khoiri, M. F. Firmansyah, G. E. Yuliastuti, and C. N. Prabiantissa, “Implementasi Algoritma Shannon-Fano untuk Kompresi File Teks,” INTEGER J. Inf. Technol., vol. 9, no. 2, pp. 5–12, 2024, doi: 10.31284/j.integer.2024.v9i2.5889.

E. Priyono and H. Mustafidah, “Text Compression Using the Shannon-Fano, Huffman, and Half-Byte Algorithms,” Int. J. Sci. Res. Manag., vol. 12, no. 09, pp. 1422–1427, 2024, doi: 10.18535/ijsrm/v12i09.ec01.

M. A. Al-Habib and A. H. Al-Saadi, “A Comparative Study of Data Compression Algorithms for Text Data,” Indones. J. Electr. Eng. Comput. Sci., vol. 22, no. 3, pp. 1505–1512, 2021, doi: 10.11591/ijeecs.v22.i3.pp1505-1512.

A. Sharma and R. K. Singh, “Performance Analysis of Lossless Text Compression Techniques Using Shannon-Fano and Huffman Coding,” Int. J. Comput. Appl., vol. 184, no. 42, pp. 15–20, 2022, doi: 10.5120/ijca2022922157.

S. K. Verma and N. Gupta, “An Efficient Lossless Data Compression Technique Using Variable Length Coding,” in International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT), 2023, pp. 87321–87330. doi: 10.1109/ACCESS.2023.3301234.

A. Farouk, “Entropy Coding Optimization Techniques,” Soft Comput., vol. 28, no. 3, pp. 4567–4580, 2024, doi: 10.1007/s00500-023-08976-1.

R. Kumar and N. Sharma, “Efficient Data Compression Using Hybrid Coding Techniques,” IEEE Access, vol. 11, pp. 87321–87330, 2023, doi: 10.1109/ACCESS.2023.3301234.

A. Al-Ali and M. R. Razalli, “A Survey on Lossless Data Compression Techniques for Text Data,” J. King Saud Univ. – Comput. Inf. Sci., vol. 35, no. 6, pp. 3102–3155, 2022, doi: 0.1016/j.jksuci.2021.02.009.

P. M. Dhulavvagol, A. Gadagkar, A. K. J, G. Hegade, R. Poonia, and S. G. Totad, “Lossless Text Compression Using Recurrent Neural Networks,” Procedia Comput. Sci., vol. 239, pp. 1–10, 2024, doi: 10.1016/j.procs.2024.04.315.

J. Kolář and P. Dvořák, “Compression of GNSS Data for Autonomous Systems,” Remote Sens., vol. 15, no. 8, pp. 2165–2178, 2023, doi: 10.3390/rs15082165.

T. D. Lawal, “An Improve Shannon Fano Data Compression Algorithm using Residue Number System,” Commun. Appl. Electron., vol. 7, no. 35, pp. 19–25, 2021, doi: 10.5120/cae2021652881.

I. Syuhada, “Implementasi Algoritma Arithmetic Coding dan Shannon-Fano Pada Kompresi Citra PN,” Terap. Inform. Nusant., vol. 2, no. 9, 2021, doi: 10.47065/tin.v2i9.102.

S. M. Simanjuntak, “Analisis Perbandingan Kompresi File Audio Menggunakan Algoritma Shannon Fano Dengan Algoritma Fibonacci Code,” J. Teknol. Inf. dan Komput., vol. 2, no. 1, pp. 1–10, 2023, doi: 10.62866/jutik.v2i1.110.

M. Rasidi, “Perbandingan Algoritma Stout Code dan Punctured Elias Code dalam Mengkompresi File Matroska Video Container,” Bull. Inf. Syst. Res., vol. 2, no. 1, pp. 1–9, 2023, doi: 10.62866/bios.v2i1.88.

I. Wardi, “Perancangan Aplikasi Kompresi File PDF dengan Menerapkan Algoritma Stout Code,” J. Sains dan Teknol. Inf., vol. 4, no. 1, pp. 1–8, 2024, doi: 10.47065/jussi.v4i1.7706.