Penerapan Kombinasi Algoritma Sequitur Dan Punctured Elias Code Untuk Kompresi File Teks

Abstract

Text files have a large size that affects the storage space and the sending process. This size is a factor in how much storage space will be used and how long it will take to send files. The longer the text, the bigger the size. large size can be overcome by doing the compression process. Compression is done to reduce the size of a file. Compression algorithms that can be used are sequitur algorithm and punctured elias code algorithm. The advantage of the sequitur algorithm is that it replaces 2 characters side by side with 1 terminal character in the character set, while the advantage of the punctured elias code algorithm is that there are two codes, namely P1 and P2. Text file compression is done by reading the input string in the text file (*txt and *.doc) and encoding the string using punctured elias code P1 and P2. The two algorithms will be combined to produce a smaller size than the previous size.