Previous chapters discuss the main classes of compression methods: RLE, statistical methods, and dictionary-based methods. There are data compression methods that are not easy to classify and do not clearly belong in any of the classes discussed so far. A few such methods are described here.
KeywordsCompression Method Input Stream Huffman Code Interword Space Arithmetic Encoder
Unable to display preview. Download preview PDF.
- Burrows, Michael and D. J. Wheeler (1994) A Block-Sorting Lossless Data Compression Algorithm, Digital, Systems Research Center report 124, Palo Alto, Calif, May 10.Google Scholar
- Fenwick, P. (1996) Symbol Ranking Text Compression, Tech. Rep. 132, Dept. of Computer Science, University of Auckland, New Zealand, June.Google Scholar
- Buyanovsky, G. (1994), “Associative Coding,” (in Russian), Monitor, Moscow, #8, 10–19, August. (Hard copies of the Russian source and English translation are available from the author of this book. Send requests to “firstname.lastname@example.org”.)Google Scholar
- Fenwick, P. (1996), “Symbol Ranking Text Compression,” Tech. Rep. 132, Dept. of Computer Science, University of Auckland, New Zealand, June.Google Scholar
- Knuth, D. E. (1973), The Art of Computer Programming, Vol. 1, 2nd Ed., Reading, MA, Addison-Wesley.Google Scholar
- Yu, Tong Lai. (1996) “Dynamic Markov Compression,” Dr Dobb’s Journal pp. 30–31, January.Google Scholar