Kompresi data menggunakan algoritma huffman

Abstract

Text compression algorithms are normally defined in terms of a source alphabet of 8- bit ASCII codes. HJ1ffman algorithm is the most popular methods of text compression. This research used static and adaptif Huffman algorithms to compress text data, and also compare it. Variation of character occurs will decrease compression ratio. Iteration time of static Huffman algorithm for compress and decompress is faster than adapiif Huffman algorithm, but performance of adaptij Huffman algorithm is best