Dictionary selection using partial matching

Information sciences

Volumn 119, Issue 1-2, 1999, Pages 57-72

  Hoang, Dzung T ^a   Long, Philip M ^b   Vitter, Jeffrey Scott ^c  

^a Digital Video Systems   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); STATISTICAL METHODS;

DICTIONARY COMPRESSION; MULTIPLE DICTIONARY COMPRESSION; STATISTICAL COMPRESSION; TEXT COMPRESSION;

DATA COMPRESSION;

EID: 0033207670     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00060-2     Document Type: Article

References (20)

1. Bell T.C., Cleary J.G., Witten I.H. Text Compression. 1990;Prentice Hall, Englewood Cliffs, NJ.
2. Bell T.C., Witten I.H. Relationship between greedy parsing and symbol-wise text compression. Journal of the ACM. 41(4):1994;708-724.
3. C. Bloom, Using prediction to improve LZ77 coders, in: Proceedings of of 1996 IEEE Data Compression Conference, 1996, p. 425 (full version available at http://wwwvms.utexas.edu/ cbloom/dcc96.html ).
4. Cleary J.G., Witten I.H. Data compression using adaptive coding and partial string matching. IEEE Transactions on Communication COMM. 32(4):1984;396-402.
5. J.G. Cleary, W.J. Teahan, I.H. Witten, Unbounded length contexts for PPM, in: Proceedings of the 1995 Data Compression Conference, 1995, pp. 52-61.
6. Fiala E.R., Greene D.H. Data compression with finite windows. Communications of the ACM. 32(4):1989;490-505.
7. P.C. Gutmann, T.C. Bell, A hybrid approach to data compression, in: Proceedings of the 1994 Data Compression Conference, Snowbird, UT, March 1994, IEEE Computer Society Press, pp. 225-233.
8. D.T. Hoang, P.M. Long, J.S. Vitter, Multiple-dictionary compression using partial matching, in: Proceedings of the 1995 IEEE Data Compression Conference, Snowbird, Utah, March 1995, pp. 272-281.
9. Howard P.G., Vitter J.S. Practical implementations of arithmetic coding. Storer J.A. Images and Text Compression. 1992;85-112 Kluwer Academic Publishers, Norwell, MA.
10. Howard P.G., Vitter J.S. Design and analysis of fast text compression based on quasi-arithmetic coding. Information Processing and Management. 30(6):1994;777-790.
11. Langdon G.G. A note on the Ziv-Lempel model for compressing individual sequences. IEEE Transactions on Information Theory. IT-29:1983;284-287.
12. Mitchell J.L., Pennebaker W.B. Optimal hardware and software arithmetic coding procedures for the Q-coder. IBM Journal of Research and Development. 32:1988;727-736.
13. A. Moffat, R. Neal, I.H. Witten, Arithmetic coding revisited, in: Proceedings of the 1995 Data Compression Conference, 1995, pp. 202-211.
14. Y. Nakano, H. Yahagi, Y. Okada, S. Yoshida, Highly efficient universal coding with classifying to subdictionaries for text compression, in: Proceedings of the 1994 Data Compression Conference, Snowbird, UT, March 1994. IEEE Computer Society Press, pp. 234-243.
15. M. Slyz, Image compression using a Ziv-Lempel type coder, Master's thesis, School of Engineering, University of Michigan, 1991.
16. Storer J.A. Data Compression: Methods and Theory. 1988;Computer Science Press, New York.
17. Vapnik V.N. Estimation of Dependencies based on Empirical Data. 1982;Springer, Berlin.
18. Welch T.A. A technique for high-performance data compression. IEEE Computer. 17:1984;8-19.
19. Ziv J., Lempel A. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory. IT-23(3):1977;337-343.
20. Ziv J., Lempel A. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory IT. 24:1978;530-536.