Sequitur Algorithm For Particular Character Compression Or Words Always Returned

 (*)Efori Buulolo Mail (Teknik Informatika STMIK Budi Darma, Indonesia)

(*) Corresponding Author

DOI: http://dx.doi.org/10.30865/ijics.v1i1.344

Abstract

Character pairs or recurrent words are often found on large documents. The document uses a large space in storage. At this time the storage with a large amount of space is not a problem anymore, with the availability of various media types of large data storage media and the price is very affordable. Although in the form of storage media is not a problem but in the storage and transmission of data, a large document would need an efficient for storage space and so does the case of data transmission. The Sequitur algorithm is one suitable algorithm for concluding context-free grammar into a compression to reduce repetitive input. The Sequitur algorithm is perfect for large document compression with paired or repeated characters so that the document uses more efficient storage space in the case of data transmission

Full Text:

PDF


Article Metrics

Abstract view : 242 times
PDF - 52 times

References

David Salomon, Data Compression. California: Computer Science Department California State University, 2007.

Surya Darma Nasution, Guidio Leonarde Ginting, Muhammad Syahrizal, and Robbi Rahim, "Data Security Using Vigenere Cipher and Goldbach Codes Algorithm," International Journal of Engineering Research & Technology (IJERT), vol. 6, no. 01, pp. 360-360, January 2007.

N. Bhaskar, "Symmetric Key Cryptography Algorithm Using Complement For Small Data Security," International Journal of Engineering Research & Technology, vol. 2, no. 5, May 2013.

M Pradeep and Dr.Y. Srinivasa Rao, "An Objective Comparison of Image Compression Techniques for JPEG Encoder," International Journal of Engineering Research & Technology, vol. 1, no. 5, July 2012.

D. Suganya Deva Malar and Mrs. S. Uma Maheswari, "Performance Comparison Of Enhanced Region Growing Segmentation Algorithm Based CT Scan Image Compression Using Discrete Wavelet Families," International Journal of Engineering Research & Technology, vol. 2, no. 5, May 2013.

J. Satheesh and D. P. Raju, "Lifting Based 3-D Discrete Wavelet Transform For Optimized Image Compression," International Journal of Engineering Research & Technology, vol. 1, no. 9, November 2012.

C. Madhavi, G. Mamatha, and B. N. Shobha, "Image Texture feature analysis for multi-focus image fusion based on discrete wavelet transform," International Journal of Engineering Research & Technology, vol. 1, no. 4, June 2012.

Dr. Shaik Meeravali and Praveena, "Multi-Resolution AHB Tracer With Real Time Compression for SOC," International Journal of Engineering Research & Technology, vol. 1, no. 9, November 2012.

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.

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Sequitur Algorithm For Particular Character Compression Or Words Always Returned

Refbacks

  • There are currently no refbacks.


Copyright (c) 2018 Efori Buulolo

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


The IJICS (International Journal of Informatics and Computer Science)
Published by STMIK Budi Darma.
Jl. Sisingamangaraja No.338 Simpang Limun, Medan, North Sumatera
Email: ijics.stmikbudidarma@gmail.com

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