Home → Magazine Archive → August 1988 (Vol. 31, No. 8) → Application of splay trees to data compression → Abstract

Application of splay trees to data compression

By D. W. Jones

Communications of the ACM, Vol. 31 No. 8, Pages 996-1007

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.

The full text of this article is premium content


No entries found