Abstract

The need for speed and storage space is the focus of recent computer technologies. The growth of an increased number of applications and important data is giving rise to new methods of having efficient compression giving rise to greater performance. This research paper provides two data compression algorithms and compares their performances based on some given text samples with the introduction of a new algorithm known as Chinese Remainder Theorem. The performance metrics used are compression size, compression time and compression ratio. The results indicate that Huffman-CRT on text outperforms LZW-CRT for compression size by 55.64% to 57.11%, compression time for Huffman-CRT is 44.61s better than LZW-CRT with 55.39s while Huffman-CRT also outperformed LZW-CRT by 3.70x to 2.37x for compression ratio.