Efficient Text Compression Algorithm Based on an Existing Dictionary

Authors

  • Chouvalit Khancome Department of Computer Science, Faculty of Science, Ramkhamhaeng University, Huamark District, Bangkok 10240, Thailand.

Keywords:

text compression, bit-level compression, dictionary base compression

Abstract

This research article presents a new efficient lossless text compression algorithm based on an existing dictionary. The proposed algorithm represents the target texts to be compressed in a bit form, and the vocabularies are stored in the existing dictionary. Regarding to the results, the time complexity only takes O(n) time of both cases of encoding and decoding scenarios. The space complexity is O(d) bit(s) per 2d words where d=1,2,3,…The theoretical results showed bits per words and maximum spaces to be saved. These results indicated that the maximum original texts could be compressed more than 99 %.

Author Biography

Chouvalit Khancome, Department of Computer Science, Faculty of Science, Ramkhamhaeng University, Huamark District, Bangkok 10240, Thailand.

Lecturer in Department of Computer Science, Faculty of Science, Ramkhamhaeng University, Huamark District, Bangkok 10240, Thailand.

Downloads

Additional Files

Published

2014-08-05

How to Cite

Khancome, C. (2014). Efficient Text Compression Algorithm Based on an Existing Dictionary. International Journal of Computer (IJC), 15(1), 29–41. Retrieved from https://www.ijcjournal.org/index.php/InternationalJournalOfComputer/article/view/319

Issue

Section

Articles