KOMPRESI FILE MENGGUNAKAN KONVERSI BINER HEXADECIMAL DAN ALGORITMA HUFFMAN ENCODING

Abstract

Along with its development, data technology in the form of files continues to grow and increase in size over time. The development of increasingly advanced technology by increasing the number of computer users which is increasingly causing an explosion in the amount of data and the rate of data transfer from one device to another. The data is generally compressed first so that the data exchange process does not take too long. The method that will be used in this research is the Huffman Encoding algorithm and Binary Hexadecimal conversion. Huffman Encoding algorithm is a compression algorithm by coding in the form of bits to represent character data, while Hexadecimal Binary conversion is a technique to change the sequence of bits to be converted into hexadecimal numbers. The results of this study are the Huffman Encoding algorithm and Hexadecimal Binary conversion can be implemented for file compression. The conclusion of this application is the Huffman Encoding method and Binary Hexadecimal conversion can compress well on 26 file extensions, however, this method is no better than the WinRAR and WinZIP compression programs. This has been proven by testing the limitations and performance of programs against 50 different file types.