Application of splay trees to data compression

Abstract

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.

References

1. 1 Bentley, J.L., Sleator, D. D., Tarjan, R. g., and Wei, V. K. A locally adaptive data compression scheme. Commun. ACM 29, 4 (Apr. 1986), 320-330.
2. 2 Gallager, R.G. Information Theory and Reliable Communication. John Wiley & Sons, New York, 1968.
3. 3 Gallager, R.G. Variations on a theme by Huffman. IEEE Trans. Inform. Theory IT-24, 6 (Nov. 1978), 668-674.
4. 4 Jones, D.W. An empirical comparison of priority queue and event set implementations. Commun. ACM 29, 4 (Apr. 1986), 300-311.
5. 5 Knuth, D.E. Dynamic Huffman coding. J. Algorithms 6, 2 (Feb. 1985), 163-180.
6. 6 Rubin, F. Arithmetic stream coding using fixed precision registers. IEEE Trans. Inform. Theory IT-25, 6 (Nov. 1979), 672-675.
7. 7 Saraswat, V. Merge trees using splaying--or how to splay in parallel and bottom-up. PROLOG Digest 5, 22 (Mar. 27, 1987).
8. 8 Sleator, D.D., and Tarjan, R.E. Self-adjusting binary trees. In Proceedings of the ACM SIGACT Symposium on Theory of Computing (Boston, Mass., Apr. 25-27). ACM, New York, 1983, pp. 235-245.
9. 9 Tarjan, R.E., and Sleator, D.D. Self-adjusting binary search trees. J. ACM 32, 3 (July 1985), 652-686.
10. 10 Vitter, J.S. Two papers on dynamic Huffman codes. Tech. Rep. CS- 85-13. Brown University Computer Science, Providence, R.I. Revised Dec. 1986.
11. 11 Welch, T.A. A technique for high-performance data compression. IEEE Comput. 17, 6 (June 1984), 8-19.
12. 12 Witten, I.H., Neal, R.M., and Cleary, J.G. Arithmetic coding for data compression. Commun. ACM 30, 6 (June 1987), 520-540.

Index Terms

• Information systems

  • Data management systems

    • Data structures

      • Data layout

        • Data compression

  • Information storage systems

    • Record storage systems

      • Directory structures

        • B-trees

      • Record storage alternatives

        • Linked lists

• Mathematics of computing

  • Discrete mathematics

    • Graph theory

      • Trees