APLIKASI GRAF POHON PADA ALGORITMA HUFFMAN
DOI:
10.29303/jpm.v6i1.122Published:
2011-03-01Issue:
Vol. 6 No. 1 (2011): MaretArticles
Downloads
How to Cite
Downloads
Metrics
Abstract
Abstrak : Sistem bilangan biner banyak digunakan dalam teknologi komputer. Bilangan biner digunakan oleh algoritma Huffman pada graf pohon. Algoritma Huffman menggunakan prinsip pengkodean yang mirip dengan
kode Morse, yaitu tiap karakter dikodekan hanya dengan rangkaian beberapa bit 0 dan 1 sesuai distribusi kemunculan karakter dalam naskah. Sedang graf pohon adalah graf tak-berarah terhubung yang tidak memuat sirkuit sederhana.
Setiap karakter dalam komputer memiliki panjang 8 bit. Dalam algoritma huffman, dengan penggunaan graf pohon dari distribusi frekuensi karakter dalam suatu pesan, ukuran panjang bit setiap karakter dapat memiliki ukuran lebih kecil dari 8 bit sehingga dapat menghemat ukuran data. Pada akhirnya dapat disimpulkan bahwa algoritma Huffman dapat digunakan untuk menghemat ukuran data dalam sistem komputer.
Kata Kunci : Huffman, graf pohon, algoritma, biner
Abstract : Binary number system is more used in computer technology. Binary number used by the Huffman algorithm on the tree in graph teory. Huffman algorithm using the principle similar to Morse code, ie each character is
encoded only by a series of multiple bits 0 and 1 corresponds to the distribution of the appearance of characters in the script. but tree is non connected graph that contains no simple circuit. Each character in the computer has a length of 8 bits. In the huffman algorithm, with the use of a tree graph of the frequency distribution of characters in data, the size of the bit length of each character can have a size smaller than 8 bits so that it can save data size. In the finally it can be concluded that the Huffman algorithm can be used to save data size in the computer system.
Keywords : Huffman, tree, Algorithm, biner
License
The following terms apply to authors who publish in this journal:
1. Authors retain copyright and grant the journal first publication rights, with the work simultaneously licensed under a Creative Commons Attribution License 4.0 International License (CC-BY License) that allows others to share the work with an acknowledgment of the work's authorship and first publication in this journal.
2. Authors may enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., posting it to an institutional repository or publishing it in a book), acknowledging its initial publication in this journal.
3. Before and during the submission process, authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website), as this can lead to productive exchanges as well as earlier and greater citation of published work (See The Effect of Open Access).
