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)
Heri, Arfan
Unknown Affiliation
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 
Perbandingan Algoritma Elias Gamma Code Dan Puncturead Elias Code Dalam Mengkompresi File Audio MP3 Heri, Arfan
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 7, No 1 (2024): Transformasi Komputasi Kuantum Untuk Percepatan Teknologi Baru
Publisher : STMIK Budi Darma

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

Abstract

In today's digital era, the use of data compression technology is very important because the utilization of data in electronic form is faster for exchanging information. Large file sizes require a lot of storage space. MP3-extended audio files have a large size compared to other types of video files. Because the size of the MP3 file is too large, the process of sending data takes a long time. One of the techniques needed for this problem is compression. Compression is the process of resizing data to a smaller size. The algorithms used in this research are the Elias Gamma Code and Punctured Elias Code algorithms, which have their own advantages and disadvantages. After the two algorithms are compressed, a comparison of the two algorithms is made using the lossless compression method. The lossless compression comparison method is one of the methods used to determine the priority order of alternative decisions based on several criteria. The final result of the comparison process with the lossless compression method obtained a result of 74.2%, which is the Punctured Elias Code algorithm. So that the algorithm becomes the fastest and most effective algorithm in compressing audio files, this is because the smaller the total value obtained, the less effort made by the algorithm in compression.
Co-Authors