A proposed combination of data compression for various size lengths

The proposed combination consists of two compression techniques, which is the focus of this research based on the observations. Together, this includes adaptive Huffman and ARC. The results of the algorithm proposed are more powerful in compressing data than Huffman, and ARC individually, which offer better DC on the same hardware. However, this approach takes longer than any previous techniques done on their own and less time than LZW. In this regard, at 32 kB the proposed algorithms achieve 2.15, while 1.684, 1.825, 1.829, and 3.62 for static Huffman, adaptive Huffman, ARC, and LZW in terms of CR. The CF of the proposed algorithm was 0.465, outperforming static Huffman, adaptive Huffman, and ARC (0.593, 0.547, 0.546) except LZW (0.276). The SR for the proposed algorithm was 53.59%, higher than static Huffman, adaptive Huffman, and ARC (40.6%, 45.3%, and 45.35%), respectively, and lower than LZW (72.38%).