IMPLEMENTASI KODE HUFFMAN DALAM APLIKASI KOMPRESI TEKS PADA LAYANAN SCHEDULED SMS MENGGUNAKAN J2ME
| Main Author: | MASKUR, MASKUR |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2010
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/16261/ |
Daftar Isi:
- SMS is a way of sending short messages in quick time with a relatively cheap price. These short messages will be sent with a maximum capacity of 160 bytes for each message. To overcome the difficulty delivering the message with the number of characters or characters with a lot of great bits, developed an application to text compression using Huffman algorithm. SMS compression application is in the form of a series of compression process, sending, receiving, and viewing. Compression process itself is an encoding process that will make a data or text has a little bit more than usual. The process of encoding with Huffman code is the code formed by frequency that appears to a character. Characters with greater frequency would have a shorter code than the characters with little frequency. The formation of Huffman code begins with forming a Huffman tree that will assist in Huffman coding. This process continued with the process of the character encoding is in accordance with existing Huffman code. Once transmitted, the process of decoding can be done in order to read the message again.