Implementing HCDC (k) and Modified HCDC (k) to Achieve Better Compression Result

Harwin C. Mendoza, Ariel M. Sison and Ruji P. Medina

In this paper, we proposed and assessed the presentation of a plan that will utilize unique HCDC (k) and altered HCDC (k) to expand the quantity of cycles and accomplish better pressure proportion. HCDC stands for Hamming Code Data Compression. In this scheme, it will count the unique characters of each iteration. If the number of unique characters is 80 and below, it will apply modified HCDC (k), otherwise it will use HCDC (k). This is beneficial since it solves the weakness of the two algorithms. The limitation of HCDC (k) is the appending of 1-bit prefix to non-valid code words which can result to inflation. The modified HCDC (k)’s weakness is it can only handle a maximum of 80 unique characters (16 valid code words, 64 non-valid code words). The combined scheme of original HCDC (k) and modified HCDC (k) will be called hybrid HCDC (k). Text files from COCA corpus were compressed and the results have shown that the proposed hybrid HCDC (k) has a higher compression power than its previous versions. The combined HCDC (k) and modified HCDC(k) achieved an average compression ratio of 1.88, higher than the average compression ratio of HCDC(k) and modified HCDC(k) which is 1.44 and 1.36 respectively. It can be used as a complimentary compression algorithm to other existing statistical compression algorithm.

Volume 12 | 01-Special Issue

Pages: 220-226

DOI: 10.5373/JARDCS/V12SP1/20201066