Hybrid AES-Huffman Coding for Secure Lossless Transmission

Ashila, Mutia Rizky; Atikah, Nur; Setiadi, De Rosal Ignatius Moses; Rachmawanto, Eko Hari; Sari, Christy Atika

doi:10.1109/icic47613.2019.8985899

Cited by 9 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Technology is currently growing rapidly along with the changing era and holding important role in the way humans communicate [1]. Currently, advances in information technology changing human habits to exchange data and information, thereby increasing digital data requests.…”

Section: Introductionmentioning

confidence: 99%

Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression

Fauzan

Alif²,

Prianto3³

2022

ITJRD

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%