Application of splay trees to data compression
- 1 August 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 31 (8) , 996-1007
- https://doi.org/10.1145/63030.63036
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.Keywords
This publication has 9 references indexed in Scilit:
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- An empirical comparison of priority-queue and event-set implementationsCommunications of the ACM, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- Dynamic huffman codingJournal of Algorithms, 1985
- A Technique for High-Performance Data CompressionComputer, 1984
- Self-adjusting binary treesPublished by Association for Computing Machinery (ACM) ,1983
- Arithmetic stream coding using fixed precision registersIEEE Transactions on Information Theory, 1979
- Variations on a theme by HuffmanIEEE Transactions on Information Theory, 1978