Context weighting for general finite-context sources

IEEE Transactions on Information Theory

Volumn 42, Issue 5, 1996, Pages 1514-1520

  Willems, Frans M J ^a,b   Shtarkov, Yuri M ^c   Tjalkens, Tjalling J ^a,b  

^a IEEE

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Arithmetic coding; Classification procedure; Cumulative redundancy bounds; Finite context sources; Modeling procedure; Sequential data compression; Universal source coding

Indexed keywords

ALGORITHMS; BINARY CODES; BINARY SEQUENCES; MATHEMATICAL MODELS; PROBABILITY; SET THEORY;

ARITHMETIC CODING; CUMULATIVE REDUNDANCY BOUNDS; ELIAS ALGORITHM; FINITE CONTEXT SOURCES; SEQUENTIAL DATA COMPRESSION; UNIVERSAL SOURCE CODING;

DATA COMPRESSION;

EID: 0030242432     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.532891     Document Type: Article

References (15)

1. F. Jelinek, Probabilistic Information Theory. New York: McGraw-Hill, 1968, pp. 476-489.
2. R. E. Krichevsky, "The connection between the redundancy and the reliability of information about the source," Probl. Inform. Transm., vol. 7, no. 3, pp. 48-57, 1968.
3. R. E. Krichevsky and V. K. Trofimov, "The performance of universal encoding," IEEE Trans. Inform. Theory, vol. IT-27, no. 2, pp. 199-207, Mar. 1981.
4. J. R. Quinlan and R. L. Rivcst, "Inferring decision trees using the minimum description length principle," Inform. Comput., vol. 80, pp. 227-248, 1989.
5. J. Rissanen, "Universal coding, information, prediction, and estimation," IEEE Trans. Inform. Theory, vol. IT-30, no. 4, pp. 629-636, July 1984.
6. _, Stochastic Complexity in Statistical Inquiry. Singapore: World Scientific, 1989.
7. B. Ya. Ryabko, "Twice-universal coding," Probl. Inform. Transm., vol. 20, no. 3, pp. 24 28, 1984.
8. Y. M. Shtarkov, "Methods of constructing lower bounds for redundancy of universal coding," Probl. Inform. Transm., vol. 18, no. 2, pp. 3-11, 1982.
9. V. K. Trofimov, "The redundancy of universal encoding of arbitrary Markov sources," Probl. Inform. Transm., vol. 10. no. 4, pp. 16-24, 1974.
10. M. J. Weinberger, A. Lempel, and J. Ziv, "A sequential algorithm for the universal coding of finite memory sources," IEEE Trans. Inform. Theory, vol. 38, no. 3, pp. 1002-1014, May 1992.
11. M. J. Weinberger, N. Merhav, and M. Feder, "Optimal sequential probability assignment for individual sequences," IEEE Trans. Inform. Theory, vol. 40, no. 2, pp. 384-396, Mar. 1994.
12. M. J. Weinberger, J. Rissanen, and M. Feder, "A universal finite memory source," IEEE Trans. Inform. Theory, vol. 41, no. 3, pp. 643-652, May 1995.
13. F. M. J. Willems, Y. M. Shtarkov, and T. J. Tjalkens, "Context tree weighting: A sequential universal source coding procedure for FSMX sources," in IEEE Int. Symp. on Information Theory (San Antonio, TX, Jan. 17-22), 1993, p. 59.
14. _, "The context-tree weighting method: Basic properties," IEEE Trans. Inform. Theory, vol. 41, no. 3, pp. 653-664, May 1995.
15. R. Nohre, "Some topics in descriptive complexity," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1998.