Tommy Tommy


Huffman encoding is a compression algorithm that uses symbol encoding using a simpler bit substitution based on the frequency of the symbol. A symbol will be represented with much fewer bits if it has a large frequency. Conversely, symbols with less frequency will be encoded with bits of greater length. The bit code for symbols with lower frequencies often has a very long size which sometimes causes the compressed file size to be larger than the original file. This study develops the implementation of two separate Huffman trees by dividing the symbol list into two lists, each of which will form a bit code in parallel. This implementation is able to minimize the length of the symbol bit code, especially in symbols with low frequencies so as to increase the compression ratio for several types of content which is become the weakness of the original Huffman.


How to Cite
Tommy, T. (2021). DUAL TREE HUFFMAN ENCODING IMPLEMENTATION TO REDUCE LOW FREQUENCY BIT CODES. INFOKUM, 9(2, June), 436-442. Retrieved from http://infor.seaninstitute.org/index.php/infokum/article/view/168


[1] K. Sayood, "Introduction to Data Compression," Morgan Kaufmann, pp. 1-80, 2006.
[2] K. Duwe, J. L¨uttgau, G. Mania, J. Squar, A. Fuchs, M. Kuhn, E. Betke and T. Ludwig, "State of the Art and Future Trends in Data Reduction for High-Performance Computing," Supercomputing Frontiers and Innovations, vol. 7, no. 1, pp. 4-36, 2020.
[3] L. A. Fitriya, T. W. Purboyo and A. L. Prasasti, "A review of data compression techniques," International Journal of Applied Engineering Research, vol. 12, no. 19, pp. 8956-8963, 2017.
[4] H. D. Kotha, M. Tummanapally and V. K. Upadhyay, "Review on Lossless Compression Techniques," J. Phys. Conf. Ser., vol. 1228, no. 1, pp. 1-6, 2019.
[5] W. E. Pangesti, G. Widagdo, D. Riana and S. Hadianti, "Implementasi Kompresi Citra Digital Dengan Membandingkan Metode Lossy Dan Lossless Compression Menggunakan Matlab," Jurnal KHATULISTIWA INFORMATIKA, vol. 8, no. 1, pp. 53-58, 2020.
[6] Tommy, R. Siregar, I. Lubis, A. M. Elhanafi, A. M. H. and M. Harahap, "A Simple Compression Scheme Based on ASCII Value Differencing," in IOP Conf. Series: Journal of Physics: Conf. Series, Vol. 1007, Medan, 2018.
[7] Pujianto, Mujito, B. H. Prasetyo and D. Prabowo, "Perbandingan Metode Huffman dan Run Length Encoding Pada Kompresi Dokumen," InfoTekJar : Jurnal Nasional Informatika dan Teknologi Jaringan, vol. 5, no. 1, pp. 216-223, 2020.
[8] C. Lamorahan, B. Pinontoan and N. Nainggolan, "Data Compression Using Shannon-Fano Algorithm," Distributed Computing, vol. 2, pp. 10-17, 2013.
[9] A. Siregar, R. Siregar, D. Handoko, Tommy and A. M. Elhanafi, "Analisis Perbandingan Kompresi Data Teks Dengan Menggunakan Algoritma Diferensiasi Ascii Dan Half-Byte," in SNASTIKOM 2020, Medan, 2020.
[10] Sunardi, S. Alam and S. R. D. R., "Implementasi Aplikasi Kompresi Data dengan Metode Huffman Code," PROSIDING SEMINAR ILMIAH SISTEM INFORMASI DAN TEKNOLOGI INFORMASI, vol. 8, no. 2, pp. 41-26, 2019.
[11] S. Ashida, H. Kakemizu, M. Nagahara and Y. Yamamoto, "Sampled-data audio signal compression with Huffman coding," in SICE 2004 Annual Conference, Sapporo, 2004.
[12] T. Hidayat and M. H. Zakaria, "Comparison of Lossless Compression Schemes for WAV Audio Data 16-Bit Between Huffman and Coding Arithmetic," International Journal of Simulation: Systems, vol. 19, no. 6, pp. 36.1-36.7, 2019.
[13] Erdal and A. Ergüzen, "An Efficient Encoding Algorithm Using Local Path on Huffman Encoding Algorithm for Compression," Applied Science, vol. 9, no. 4, pp. 1-19, 2019.
[14] A. H. David, "A Method for the Construction of Minimum-Redundancy Codes," Proc. IRE, vol. 40, no. 9, p. 1098–1101, 1952.

DB Error: Unknown column 'Array' in 'where clause'