Claim Missing Document
Check
Articles

Found 1 Documents
Search

Penarapan Algoritma Prefix Code Dalam Kompresi Data Teks Saragih, Soumi Rohmah; Utomo, Dito Putro
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 4, No 1 (2020): The Liberty of Thinking and Innovation
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/komik.v4i1.2691

Abstract

Data compression technology is the process of converting a set of data into a lower coded representation of data that is not encoded with a certain encoding. Data compression is done by encoding each character into a shorter coded message, in order to save storage space requirements and time for data transmission. Compression is used to speed up the process of sending from uncoded characters to certain encoded characters. By compressing, large data will be reduced in size so as to save storage capacity. In this study the authors use the Prefix Code algorithm, using this method the compression results are very good in transmitting data and moving text data allocations easier and faster. By compressing, large data will be reduced in size so as to save storage space. There are many types of methods or algorithms in text data compression, but in this algorithm the writer only wants to know the compression process using the Prefix Code algorithm using C1 code where the author has succeeded in compressing text data with the prefix code algorithm using C1 code has the ability to compress text data by 58.3% on a text data.Keywords: Compression, Text, Data, Prefix Code, Algorithm.