Paper Info
Title
Modifying Bit-Level Data Compression Scheme based on Adaptive Hamming Code Data Compression Algorithm
Abstract
This paper is directed towards the development of an improved HCDC(k) to minimize the possibility of inflation. An improved adaptive hamming code data compression has been developed by reducing the number of bits used when substituting a non-valid codeword. The proposed algorithm is expected to provide greater compression ratio, space savings, and compression speed. It is also expected to minimize the possibility of inflation when compressing random texts. To evaluate the efficiency of the modified algorithm, simulations were conducted to compress sample texts from COCA corpus and random texts using the original HCDC(k) and modified HCDC(k). Compressing sample texts from COCA corpus lead to a significant difference of 7.5% in space savings and 0.11 in compression ratio. The simulation conducted with random texts lead to a significant difference of 10.45% in space savings and 0.1 in compression ratio. This means that the modified algorithm is more effective when solving inflation.
Year
DOI
Venue
2019
10.1109/MAPR.2019.8743541
2019 International Conference on Multimedia Analysis and Pattern Recognition (MAPR)
Keywords
DocType
ISBN
HCDC,HCDC(k),data compression,bit-level,codeword
Conference
978-1-7281-1830-7
Citations 
PageRank 
References 
0
0.34
5
Authors
3
Name
Order
Citations
PageRank
Harwin C. Mendoza100.34
Ariel M. Sison206.76
Ruji P. Medina315.79