Open AccessImplementasi Algoritma Kompresi Data Huffman Untuk Memperkecil Ukuran File MP3 Player
Author(s) -
Victor Amrizal
Publication year - 2011
Publication title -
jurnal teknik informatika/jurnal teknik informatika
Language(s) - English
Resource type - Journals
eISSN - 2549-7901
pISSN - 1979-9160
DOI - 10.15408/jti.v2i1.8
Subject(s) - huffman coding , computer science , symbol (formal) , character (mathematics) , canonical huffman code , data compression , code (set theory) , coding (social sciences) , binary code , arithmetic , algorithm , speech recognition , binary number , mathematics , programming language , systematic code , decoding methods , statistics , geometry , set (abstract data type) , low density parity check code
Process to minimize file is by undertaking compression to that file. Text compression process aims to reduce symbol purpose repeat or character that arrange text by mengkodekan symbols or that character so room the need storage can be reduced and data Transfer time can faster. Text compression process can be done by mengkodekan segments of original text is next to be placed deep lexical. Process compression can be done by various algorithm media, amongst those Coding's Huffman that constitutes one of tech compression which involve frequency distribution a symbol to form unique code. Symbol frequency distribution will regard long its Huffman code, progressively frequent that symbol texts deep appearance therefore Huffman code length that resulting will get short. This method mengkodekan symbols or characters with binary treed help by merges two character emergence frequencies smallest until molded treed codes. Keywords:. Huffman Coding, kompresi data, algoritma.