Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal IT JOURNAL RESEARCH AND DEVELOPMENT
Cahyo Prianto3
Department of Informatics Engineering, Polytechnic Pos Indonesia
Computer Science & IT Control & Systems Engineering Engineering

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

Found 1 Documents
Search

 1 
Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression Mohamad Nurkamal Fauzan; Muhammad Alif; Cahyo Prianto3
IT Journal Research and Development Vol. 7 No. 2 (2023)
Publisher : UIR PRESS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25299/itjrd.2023.10437

Abstract

The development of data storage hardware is very rapidly over time. In line with the development of storage hardware, the amount of digital data shared on the internet is increasing every day. That way no matter how big the size of the storage device we have, of course, it will only be a matter of time until that storage space is exhausted. Therefore, in terms of maximizing storage space, a technique called compression emerged. This study focuses on a comparative analysis of 2 Lossless compression technique algorithms, namely the Huffman algorithm and Lempel Ziv Welch (LZW). A number of test files with different file types are applied to both algorithms that are compared. The performance of the algorithm is determined based on the comparison of space saving and compression time. The test results showed that the Lempel Ziv Welch (LZW) algorithm was superior to Huffman’s algorithm in .txt file type compression and .csv, the average space savings produced were 63.85% and 77.56%. The degree of compression speed that each algorithm produces is directly proportional to the file size.
Co-Authors Mohamad Nurkamal Fauzan Muhammad Alif