Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)
Arianti Rhamadani
Universitas Budi Darma, Medan
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Analisa Perbandingan Algoritma Taboo Codes Dan Algoritma Yamamoto’s Recursive Code Untuk Kompresi File Teks Menggunakan Metode Exponential Arianti Rhamadani
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 6, No 1 (2022): Challenge and Opportunity For Z Generation in Metaverse Era
Publisher : STMIK Budi Darma

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

Abstract

In the current digital era, the use of data compression technology is very important because the use of data in electronic form is faster to exchange information. Large file sizes require a lot of storage space. Rich text format (rtf) text files have a large size compared to other types of text files with extensions. Because the file size with the extension .rtf is too large, the data transmission process takes a long time. One of the techniques required for this problem is to perform compression. Compression is the process of resizing data to a smaller size. The algorithms used in this study are the Taboo Codes and Yamamoto’s Recursive Code algorithms, each of which has advantages and disadvantages. After the two algorithms are compressed, then a comparison of the two algorithms is carried out using the Exponential method. The exponential comparison method is one of the methods used to determine the priority order of decision alternatives with several criteria. The final result of the comparison process with the exponential method is 7,203, which is Yamamoto’s Recursive Code algorithm. So that the algorithm becomes the fastest and most effective algorithm in compressing text files, this is because the smaller the total value obtained, the less effort is made by the algorithm in compression.
Co-Authors