Perancangan Aplikasi Kompresi File Teks dengan Menerapkan Algoritma Sequitur
DOI:
https://doi.org/10.30865/jurikom.v6i1.1297Abstract
Text files or text data is one component that is very important for each person as well as for each agency in the form of printed or multi-media. Where files or data can store some important things in it, the greater the size of a file or data the greater the storage media that will be needed. By looking at the compression requirements of the file or data, there is a need for compression or compression on the data, so that it can reduce usage in the external storage media space, minimize bandwidth requirements, speed up the data transmission process, and compress the ratio higher than the data results before compression. The compression process is done to solve problems in storage media, where the algorithm for compression uses the sequitur algorithm.
References
Cut Try Utari, "Implementasi Algoritma Run Length Encoding Untuk Perancangan Aplikasi Kompresi Dan Dekompresi File C itra," Jurnal Time, vol. V, no. 233-3601, p. 2, 2016.
Surya Darma Nasution et al, "Goldbach Codes Algorithm For Text Compression," International Jornal of Software & Hardware Research in Engineering, vol. 4, no. 2347-4890, p. 11, November 2016.
MLIS et al, Umi Proboyekti S.kom., "kompresi data teks menggunakan pendekatan grammar compression dengan algoritma sequitur," jurnal informatika, vol. vol.03, no. 1693-7279, april 2007.
David Salomon et al, "introduction," in Handbook of Data Compression. New York, Inggris: British Library, 2010, ch. 978-1-84882-903-9, p. 12.
