Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
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.
Manber, U., and E. W. Myers (1993) “Suffix Arrays: A New Method for On-Line String Searches,” SIAM Journal on Computing 22(5):935–948, October.
McCreight, E. M. (1976) “A Space Economical Suffix Tree Construction Algorithm,” Journal of the ACM 32(2):262–272, April.
Fenwick, P. (1996) Symbol Ranking Text Compression, Tech. Rep. 132, Dept. of Computer Science, University of Auckland, New Zealand, June.
Shannon, C. (1951) “Prediction and Entropy of Printed English,” Bell System Technical Journal 30(l):50–64, January.
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 “dxs@ecs.csun.edu”.)
Fenwick, P. (1996), “Symbol Ranking Text Compression,” Tech. Rep. 132, Dept. of Computer Science, University of Auckland, New Zealand, June.
Praenkel, A. S., and S. T. Klein (1985), “Novel Compression of Sparse Bit-Strings— Preliminary Report,” in A. Apostolico and Z. Galil, eds., Combinatorial Algorithms on Words, Vol. 12, NATO ASI Series F: 169–183, New York, Springer-Verlag.
Knuth, D. E. (1973), The Art of Computer Programming, Vol. 1, 2nd Ed., Reading, MA, Addison-Wesley.
Horspool, N. R. and G. V. Cormack (1992) “Constructing Word-Based Text Compression Algorithms,” in Proceedings of the 1992 Data Compression Conference, J. Storer Ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 62–71, April.
Witten, I. H., T. C. Bell, M. E. Harrison, M. L. James, and A. Moffat (1992) “Textual Image Compression,” in Proceedings of the 1992 Data Compression Conference, J. Storer ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 42–51.
Witten, I. H., et al. (1994) Managing Gigabytes: Compressing and Indexing Documents and Images, New York, Van Nostrand Reinhold.
Cormack G. V. and R. N. S. Horspool (1987) “Data Compression Using Dynamic Markov Modelling,” The Computer Journal 30(6):541–550.
Yu, Tong Lai. (1996) “Dynamic Markov Compression,” Dr Dobb’s Journal pp. 30–31, January.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Salomon, D. (1998). Other Methods. In: Data Compression. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2939-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2939-9_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98280-9
Online ISBN: 978-1-4757-2939-9
eBook Packages: Springer Book Archive