Analysis of Even-Rodeh Code For Text Compression
DOI:
https://doi.org/10.30865/ijics.v4i1.1348Keywords:
Text Compression, Even-Rodeh Code, LosslessAbstract
Text compression is used to reduce the repetition of letters so that the storage space used becomes smaller and transmission becomes faster. Techniques in text compression that can be used are using lossless compression. Lossless compression is a type of compression where when the decompression process occurs no data is lost. The Even-Rodeh Code algorithm is a lossless type of compression algorithm that replaces the initial bit code of the data with a code from the Even-Rodeh Code algorithm so that it can produce smaller data sizesReferences
M. Sharma, “Compression Using Huffman Coding,†IJCSNS Int. J. Comput. Sci. Netw. Secur., vol. 10, no. 5, p. 133, 2010.
M. A. Budiman and D. Rachmawati, “On Using Goldbach G0 Codes and Even-Rodeh Codes for Text Compression,†IOP Conf. Ser. Mater. Sci. Eng., vol. 180, no. 1, pp. 1–7, 2017.
S. D. Nasution and Mesran, “Goldbach Codes Algorithm for Text Compression,†IJournals Int. J. Softw. Hardw. Res. Eng., vol. 4, no. December, pp. 43–46, 2016.
S. D. Nasution, G. L. Ginting, M. Syahrizal, and R. Rahim, “Data Security Using Vigenere Cipher and Goldbach Codes Algorithm,†Int. J. Eng. Res. Technol., vol. 6, no. 01, pp. 360–363, 2017.
D. Salomon, D. Bryant, and G. Motta, Handbook of Data Compression (Google eBook), Fifth. Springer, 2010.
