An efficient repetition finder for improving dynamic Huffman coding
Chia-Hsu Kuo, Mu‐King Tsay, Cheng‐Chang Lu · IEEE Transactions on Communications · 1997
In this paper, a new repetition finder to be used with dynamic Huffman (1952) coding is proposed to improve the compression efficiency by reducing the redundancy due to string repetitions. Compared to the repetition finder proposed by Yokoo (1991), the proposed scheme effectively increases the numbers of consecutive symbols in the repetition mode and the total number of symbols in the repetition mode. Experimental results show that the proposed method outperforms the repetition finder of Yokoo by 14-40% in compression ratios with about the same memory requirement and running time.