Article Per Year (5 Year)
p-Index From 2019 - 2024
1.573
P-Index
This Author published in this journals
All Journal J-SAKTI (Jurnal Sains Komputer dan Informatika) IJISTECH (International Journal Of Information System & Technology) Jurnal Mantik IJISTECH Jurnal FASILKOM (teknologi inFormASi dan ILmu KOMputer) J-SAKTI (Jurnal Sains Komputer dan Informatika) Jurnal Pengabdian Masyarakat IPTEK Jurnal ABDIMAS Budi Darma
Imam Saputra
Universitas Budi Darma
Agriculture, Biological Sciences & Forestry Automotive Engineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Electrical & Electronics Engineering Energy Engineering Environmental Science Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Materials Science & Nanotechnology Mathematics Mechanical Engineering Social Sciences Other

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

Found 1 Documents
Search
Journal : IJISTECH (International Journal Of Information System

 1 
Performance Analysis of Lossless Type of Compression Algorithm in Compression Data Surya Darma Nasution; Imam Saputra
IJISTECH (International Journal of Information System and Technology) Vol 6, No 3 (2022): October
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v6i3.242

Abstract

As a result of processing data in the form of documents too often, document files accumulate on storage media and make the storage media lack free space. One solution that can prevent this is data compression. In this study, we will try to analyze the performance of lossless algorithms, some of which are: Goldbach's Algorithm, Fibonacci's Algorithm, Rice Codes Algorithm, Additive Codes, and Yamamoto's Recursive Codes Algorithm. The main reason why a comparison is needed is to see which algorithm is the best, it is worth doing as a basis for making applications that can compress data because application users want the best results for them, and in this case, are those that can compress files and produce the smallest size compared to other algorithms. The data to be compressed is text data. The results obtained from the test are the Goldbach Codes and Fibonacci Codes algorithms are superior to the third algorithm and several times have the same results, namely compression ratios of 60% to 68% and space savings ranging from 32% to 40%.
Co-Authors Alwin Fau Aminuddin Aziz Anda Yanny Azlan Azlan Calvin Yosafat Fince Tinus Waruwu Hutabarat, Sumiaty Adelina Johannes Pardede Kurnia Ulfa Rivalri Kristianto Hondro Saidi Ramadan Siregar Surya Darma Nasution