YK data compression algorithms: complexity, implementation, and experimental results

We present an efficient implementation of the YK data compression algorithms of Yang and Kieffer (see IEEE Trans. Inform. Theory, vol.46, p.755-7, 2000), and show that they have essentially linear computation and storage complexities. Experimental results show that: (1) on standard data sets, these algorithms achieve compression performance comparable to that of PPM algorithms; (2) on data that are frequently encountered in real-time communications (such as HTML files), the YK algorithms achieve better compression performance than that of PPM algorithms.