Comparative Analysis of Sequitur Algorithm with Adaptive Huffman Coding Algorithm on Text File Compression with Exponential Method
Keywords:
Compression, Text file, Adaptive Huffman Coding, Sequitur, Exponential.Abstract
This research was conducted to analyze and compare sequitur algorithm with the adaptive Huffman coding algorithm in compressing text file, to find which algorithm more effective and efficient in compressing compressed text file will be compared with an exponential method to be seen the performance of each algorithm based on CR, SS, RC. Text file compression will read the current string in the text file. In the Huffman adapting algorithm the text file coding will be changed into bit form, and the sequitur algorithm will change the file based on the grammar. The test result states that Huffman adapting coding algorithm is no better than sequitur algorithm.
References
- S. Porwal, Y. Chaudhary, J. Joshi, and M. Jain, "Data Compression Methodologies for Lossless Data and Comparison between Algorithms," vol. 2, no. 2, pp. 142?147, 2013.
- C. G. Nevill-Manning and I. H. Witten, "Identifying Hierarchical Structure in Sequences: A linear-time algorithm," J. Artif. Intell. Res., vol. 7, pp. 67?82, 1997.
- Darma Putra, Pengolahan Citra. Yogyakarta: C.V ANDI OFFSET, 2010.
- S. D. Nasution and Mesran, "Goldbach Codes Algorithm for Text Goldbach Codes Algorithm for Text Compression," 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. 1, pp. 360?363, 2017.
- E. Jubilee, Rahasia Manajemen File. Elex Media Komputindo, 2010.
- D. Salomon and G. Motta, HandBook Of Data Compression. Springer.
- M. S. Prof.Dr. Ir. Marimin, Pengambilan Keputusan Kriteria Majemuk. Jakarta: Grasindo, 2004.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRST

This work is licensed under a Creative Commons Attribution 4.0 International License.