Universal lossless compression via multilevel pattern matching

IEEE Transactions on Information Theory

Volumn 46, Issue 4, 2000, Pages 1227-1245

  Kieffer, John C ^a   Yang, En Hui ^b   Nelson, Gregory J ^c   Cosman, Pamela ^d  

^a University of Minnesota   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c Anoka Ramsey Community College   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; DATA STRUCTURES; DIGITAL ARITHMETIC; PATTERN MATCHING;

ARITHMETIC CODING; DATA RECONSTRUCTION; DATA STRING; MULTILEVEL PATTERN MATCHING CODE; UNIVERSAL CODE;

CODES (SYMBOLS);

EID: 0034226985     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.850665     Document Type: Article

References (17)

1. J. Bugajski and J. Russo, Data compression with pipeline processors having separate memories, U.S. Patent 5245337, Sept. 1993.
2. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
3. I. Csiszár and J. Körner, Information Theory, Coding Theorems for Discrete Memoryless Systems. Budapest, Hungary: Akadémiai Kaidó, 1981.
4. P. Elias, Universal codeword sets and representations of the integers, IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, Mar. 1975.
5. C. Hobby and N. Ylvisaker, Some structure theorems for stationary probability measures on finite state sequences, Ann. Math. Statist., vol. 35, pp. 550-556, 1964.
6. J. Kieffer and E. Yang, Grammar based codes: A new class of universal lossless source codes, IEEE Trans. Inform. Theory, vol. 46, pp. 737-754, May 2000.
7. _, Redundancy of MPM data compression system, in Proc. 1998 IEEE Int. Symp. Information Theory, Cambridge, MA, p. 136.
8. J. Kieffer, G. Nelson, and E. Yang, Tutorial on the quadrisection method and related methods for lossless data compression, Dept. Elec. Comput. Eng., Univ. Minn., Tech. Rep., 1996.
9. J. Kieffer, T. Park, Y. Xu, and S. Yakowitz, Progressive lossless image coding via self-referential partitions, in Proc. 1998 Intl. Conf. Image Processing, vol. 1, Chicago, IL, pp. 498-502.
10. G. Louchard and W. Szpankowski, On the average redundancy rate of the Lempel-Ziv code, IEEE Trans. Inform. Theory, vol. 43, pp. 2-8, Jan. 1997.
11. A. Moffat, R. Neal, and I. Witten, Arithmetic coding revisited, in Proc. 1995 Data Compression Conf., Snowbird, UT, pp. 202-211.
12. G. Nelson, J. Kieffer, and P. Cosman, An interesting hierarchical lossless data compression algorithm, in Proc. 1995 IEEE Information Theory Soc. Workshop, Rydzyna, Poland.
13. T. Park, Computational considerations in quadrisection image compression, Honors thesis, Dept. Syst. Indust. Eng., Univ. Ariz., 1997.
14. E. Plotnik, M. Weinberger, and J. Ziv, Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm, IEEE Trans. Inform. Theory, vol. 38, pp. 66-72, Jan. 1992.
15. S. Savari, Redundancy of the Lempel-Ziv incremental parsing rule, IEEE Trans. Inform. Theory, vol. 43, pp. 9-21, Jan. 1997.
16. C. Teng and D. Neuhoff, An improved hierarchical lossless text compression algorithm, Proc. 1995 IEEE Data Compression Conf., pp. 292-301.
17. J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.