Enhancing the compression ratio of the HCDC text compression algorithm

المؤلفون المشاركون

Imad, Ahmad
al-Bahadili, Husayn
Isa, Ghassan Farid

المصدر

International Computer Sciences and Informatics Conference, Amman, Jordan 12-13 January 2016.

الناشر

جامعة عمان العربية

تاريخ النشر

2016-01-31

دولة النشر

الأردن

عدد الصفحات

11

التخصصات الرئيسية

الرياضيات

الملخص الإنجليزي

The Hamming Codes based Data Compression (HCDC) algorithm is a lossless data compression algorithm based on the concept of the error-correction Hamming Codes.

The HCDC algorithm has been used successfully in a number of text compression applications providing a competitive compression ratio to existing well-known text compression algorithms.

This paper describes an enhanced version of the HCDC algorithm, which is referred to as E-HCDC algorithm.

The E-HCDC utilizes a new encoding scheme called the m-encoding scheme, where m represents the maximum length for the pre-fix bits.

The compression ratios achieved by the E-HCDC are calculated for a number of text files of various sizes from widely-used corpora, and it reveals an improvement of 15% to 20% over the original HCDC algorithm.

نوع البيانات

أوراق مؤتمرات

رقم السجل

BIM-767289

• APA
• MLA
• AMA