Efficient Data Compression Scheme using Dynamic Huffman Code Applied on Arabic Language
Sameh Ghwanmeh, Riyad Al-Shalabi & Ghassan Kanaan
Journal of Computer Science, Volume 2, Issue 12, pp. 885–888 · doi.org/10.3844/jcssp.2006.885.888
Abstract
The development of an efficient compression scheme to process the Arabic language represents a difficult task. This paper employs the dynamic Huffman coding on data compression with variable length bit coding, on the Arabic language. Experimental tests have been performed on both Arabic and English text. A comparison is made to measure the efficiency of compressing data results on both Arabic and English text. Also a comparison is made between the compression rate and the size of the file to be compressed. It has been found that as the file size increases, the compression ratio decreases for both Arabic and English text. The experimental results show that the average message length and the efficiency of compression on Arabic text is better than the compression on English text. Also, results show that the main factor which significantly affects compression ratio and average message length is the frequency of the symbols on the text.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2006 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Ghwanmeh, S., Al-Shalabi, R. & Kanaan, G. (2006). Efficient Data Compression Scheme using Dynamic Huffman Code Applied on Arabic Language. Journal of Computer Science, 2(12), 885–888. https://doi.org/10.3844/jcssp.2006.885.888
- Licence
- © Science Publications
- Issue
- Volume 2, Issue 12
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
