<![CDATA[In the current era, information needs are very important for the general public because the more information is stored digitally, the greater the data storage media needed. Therefore, an alternative data storage process is needed in order to store as much data as possible using existing storage media. In image file compression, decompression is very necessary so that the data compression process works optimally. The compression process is used to reduce file size, while the decompression process is a way to restore compressed data to original data. Basically, image compression techniques are used to find out how to transmit data (data transmission) and store data (storage). The method used in this research is the Golomb Code algorithm for the compression process on image files and the RSA (Rivest-Shamir-Adleman) algorithm to secure image files that have been compressed. It is hoped that the implementation of the Golomb Code algorithm for image file compression by applying the RSA algorithm for securing image files after compression will provide efficient results in terms of the size of the compressed image file, as well as providing an adequate level of security to protect the compressed data. In determining the compression criteria results using the Golomb code algorithm, they are Compression Ratio (RC) = 1.63%, Compression Ratio (CR) = 61.11%, Redundancy (Rd) = 38.88%, Space Saving (Ss) = 38.89%.]]>
Copyrights © 2024
