Enhancing the Compression Ratio of the HCDC Text Compression Algorithm

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 exist...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Journal of Advanced Studies in Computers, Science and Engineering Ročník 5; číslo 11; s. 64
Hlavní autoři: Al-Bahadili, Hussein, Issa, Ghassan F, Imad, Ahmed
Médium: Journal Article
Jazyk:angličtina
Vydáno: Gothenburg International Journal of Advanced Studies in Computers, Science and Engineering 01.11.2016
Témata:
Algorithms
Compressing
Compression ratio
Data compression
Hamming codes
Lossless
Mathematical analysis
Texts
ISSN:2278-7917
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 mencoding scheme, where m represents the maximum length for the pre-fix bits. The compression ratios achieved by the EHCDC 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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:2278-7917