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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
