Open AccessPerformance Analysis of Start-Step-Stop Codes and Gopala-Hemachandra Codes2 (GH-2(n)) Ascompression Algorithms on Text Files
Author(s) -
Mohammad Andri Budiman,
Herriyance,
Khairunnada
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1566/1/012073
Subject(s) - algorithm , computer science , data compression , homogeneous , compression (physics) , string (physics) , compression ratio , code (set theory) , mathematics , programming language , engineering , materials science , set (abstract data type) , combinatorics , automotive engineering , composite material , mathematical physics , internal combustion engine
Data compression was born as a solution to human needs for digital data. This research compares two compression algorithms, namely the Start-Step-Stop code algorithm and Gopala-Hemachandra codes 2 (GH -2 (n)) algorithm in the case of text file compression. compression ratio (CR), space savings (SS), bit rate and running time are calculated in the test as consideration to compare the advantages of both algorithms. Tests carried out using homogeneous strings, heterogeneous strings and artificial corpus. In homogeneous string compression, both algorithms have the same advantages because the value of CR, SS and bit rate are the same for each number of strings used. From the time of compression, Start-Step-Stop algorithm faster than the Gopala-Hemachandra algorithm. Testing of heterogeneous strings found that the Start-Step-Stop algorithm is superior to the Gopala-Hemachandra algorithm because it can save more storage space.