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)
Tegar Syah Pratama
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 Yamamoto Recursive Code Dan Elias Gamma Code Dalam Kompresi File Teks Tegar Syah Pratama
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.5735

Abstract

The development of increasingly advanced technology and the increasing number of computer users causes a data explosion and data transfer from one device to another. There are various types of multimedia data that can be loaded, namely text, images, audio (sound, sound, music) and video. The data is generally compressed first so that the exchange process does not take too long. Many things have been done to overcome this, one way is to reduce the size of the files stored by using file compression techniques. There are many algorithms that have been used to compress files, 2 of which are Yamamoto Recursive Code and Elias Gamma Code. So that the comparison process of the two algorithms will be carried out by determining the parameters, namely Ratio Of Compression (RC), Compression Ratio (RC), Redurancy (RD), and Space Saving (SS). Based on the calculation results, the results of the Yamamoto Recursive Code algorithm performance measurement can compress text files by 85%. Meanwhile, the performance of the Elias Gamma Code Algorithm can compress text files by "60,62%." So it can be concluded that the Elias Gamma Code algorithm is better at compressing text files.
Co-Authors