Comparison Analysis with Huffman Algorithm and Goldbach Codes Algorithm in File Compression Text Using the Method Exponential Comparison

 (*)Abu Sani Tanjung Mail (STMIK Budi Darma, North Sumatra, Indonesia)
 Surya Darma Nasution (STMIK Budi Darma, North Sumatra, Indonesia)

(*) Corresponding Author

DOI: http://dx.doi.org/10.30865/ijics.v4i1.1387

Abstract

With the development of technology at this time many people know about compression. In simple compression is a process to shrink the file from its original size. At this time compression applications that are often used are WinZip, WinRar, and 7-Zip, namely with the aim of compressing documents and saving space on memory or data transmission. Compressed data can be in the form of images, audio, video and text. The use of the Huffman algorithm and the Goldbach Codes algorithm in compressing text files is intended to provide enormous benefits in the sending and storage process and requires less memory space compared to uncompressed text. The algorithm starts by providing a string of inputs as input, how to produce an algorithm output in the form of a binary string or code that translates each input string, so that the string has a small number of bits compared to strings that are not compressed. Thus, the problem is how to obtain the code with sorted characters and frequency tables as input and shorter binary code as output. In applying the Huffman algorithm and the Goldbach Codes algorithm in compressing text files is very good, the results were not reduced from the original file or there was no reduction

Keywords


Huffman, Goldbach Codes, Compression, Exponential Comparison Methods

Full Text:

PDF


Article Metrics

Abstract view : 216 times
PDF - 85 times

References

Nuryasin, "Perbandingan Kompresi File Data Dengan Algoritma Huffman, Helf Byte Dan Run Length," Studi Informatika: Jurnal Sistem Informasi, Vol. 7, No. 1979-0767, Pp. 1-6, Februari 2014.

Mesran Surya Darma Nasution, "Goldbach Codes Algorithm For Text Compression," IJournals: International Journal Of Software & Hardware Research In Engineering, Vol. 4, No. 11 November, 2016 , Pp. 43-46, November 2016.

Ari Wibowo, "Kompresi Data Menggunakan Metode Huffman," Seminar Nasional Teknologi Informasi & Komunikasi Terapan 2012 (Semantik 2012), vol. Juni, pp. 47-51, Juni 2012.

Abdul Kadir, Algoritma & Pemrograman Menggunakan C & C ++. Yogyakarta: Penerbit Andi, 2012.

Abdul Kadir, Pengenalan Algoritma, Pendekatan Secara Visual Dan Interaktif Menggunakan Raptor. Yogyakarta: Penerbit Andi, 2013.

D. Huffman, "A Method for the Construction of Minimum-Redundancy Codes," Proceedings of the IRE, vol. September, pp. 1098-1101, September 1952.

D. Salomon G. Motta, Handbook Of Data Compression, Springer, Fifth Edition ed. Springer London Dordrecht Heidelberg New York, 2010.

Marimin, Teknik dan Aplikasi Pengambilan Keputusan Kriteria Majemuk. Jakarta: Grassindo, 2004.

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Comparison Analysis with Huffman Algorithm and Goldbach Codes Algorithm in File Compression Text Using the Method Exponential Comparison

Refbacks

  • There are currently no refbacks.


Copyright (c) 2020 Abu Sani Tanjung, Surya Darma Nasution

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.


The IJICS (International Journal of Informatics and Computer Science)
Published by STMIK Budi Darma.
Jl. Sisingamangaraja No.338 Simpang Limun, Medan, North Sumatera
Email: ijics.stmikbudidarma@gmail.com

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.