Application of splay trees to data compression

By D. W. Jones

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

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

0 Comments

No entries found

Purchase the Article

Application of splay trees to data compression

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine