论文信息 - Application of splay trees to data compression

Application of splay trees to data compression

The splay-prefix algorithm is one of the simplest and fastest adaptive data compression algorithms based on the use of a prefix code. The data structures used in the splay-prefix algorithm can also be applied to arithmetic data compression. Applications of these algorithms to encryption and image processing are suggested.

Douglas W. Jones | Douglas W. Jones

[1] Robert E. Tarjan,et al. A Locally Adaptive Data , 1986 .

[2] Terry A. Welch,et al. A Technique for High-Performance Data Compression , 1984, Computer.

[3] Robert G. Gallager,et al. Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.

[4] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

[5] Donald E. Knuth,et al. Dynamic Huffman Coding , 1985, J. Algorithms.

[6] Robert E. Tarjan,et al. Self-adjusting binary trees , 1983, STOC.

[7] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .

[8] Douglas W. Jones,et al. An empirical comparison of priority-queue and event-set implementations , 1986, CACM.

[9] Frank Rubin,et al. Arithmetic stream coding using fixed precision registers , 1979, IEEE Trans. Inf. Theory.

[10] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.

[11] J. S. Vitter. Two papers on dynamic Huffman codes , 1987 .