Abstract
The efficiency of data compression with the help of universal coding depends on the used model or set of models of the source. By expanding the set of models and/or increasing their complexity we can improve the approximation of the statistical properties of messages. However, this entails a higher redundancy and (usually) a higher complexity of coding. For this reason, the development of comparatively simple models capable of improving the statistical description of messages is of great importance. Not surprisingly, this problem has attracted much attention.
This work was partly supported by the Russian Foundation of Basic Research (project number 96-01-0084) and by INTAS (project number 94469)
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.
References
P.A.J. Volf and F.M.J. Willems, “A Context-Tree Branch-Weighting Algorithm,”, Proc. of 18th Symp. on Inform. Theory in the Benelux, 1997, 115–122.
M. J. Weinberger, J. J. Rissanen and R. B. Arps, “Applications of Universal Context Modeling to Losseless Compression of Gray-Scale Images”, IEEE Trans. Image Processing, vol. 5, no. 4, 1996, 575–586.
Yu.M. Shtarkov, “Coding of discrete sources with unknown statistics”, Topics in Inform. Theory (Second Colloquium, Keszely, 1975), Colloquia Mathematica Sosietatis Janos Bolyai, Amsterdam, North Holland, vol. 16, 1977, 559–574.
Yu.M. Shtarkov, “Universal Sequential Coding of Single Messages”, Probl. Inform. Trans., vol. 23, no. 3, 1987, 3–17.
B.Ya. Ryabko, “Twice-Universal Coding”, Probl. Inform. Trans., vol. 20, no. 4, 1984, 396–402.
B.Ya. Ryabko, “Prediction of Random Sequences and Universal Coding”, Probi. Inform. Trans., vol. 24, no. 2, 1988, 3–14.
J.J. Rissanen, Stochastic Complexity in Statistical Inquiry, New Jersey: World Scientific Publ. Co., 1989.
Yu.M. Shtarkov, “Aim Functions and Sequential Estimation of Source Model for Universal Coding”, Probl. Inform. Trans., vol. 35, no. 3, 1999.
J.J. Rissanen, “Complexity of Strings in the Class of Markov Sources”, IEEE Trans. Inform. Theory, vol. 32, no. 4, 1986, 526–532.
F.M.J. Willems, Yu.M. Shtarkov and Tj.J. Tjalkens, “Context Tree Weighting: A Sequential Universal Coding Procedure for FSMX Sources”, Proc. 1993 IEEE Intern. Symp. Inform. Theory, USA, 1993, 59.
F.M.J. Willems, Yu. M. Shtarkov and Tj. J. Tjalkens, “The Context Tree Weighting Method: Basic Properties”, IEEE Trans. Inform. Theory, vol. 41, no. 3, 1995, 653–664.
Yu.M. Shtarkov, Tj.J. Tjalkens and F.M.J. Willems, “Multialphabet Weighted Universal Coding of Context Tree Sources”, Probl. Inform. Trans., vol. 33, no. 1, 1997, 3–11.
M.J. Weinberger, J. J. Rissanen and M. Feder, “A Universal Finite Memory Source” IEEE Trans. Inform. Theory, vol. 41, no. 3, 1995, 643–652.
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., 1992, 1002–1014.
B. Balkenhol, S. Kurtz, and Yu.M. Shtarkov, “Modifications of the Burrows and Wheeler Data Compression Algorithm”, Proc. of Data Compression Conference, 1999, 188–197.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shtarkov, Y.M. (2000). Universal Coding of Non-Prefix Context Tree Sources. In: Althöfer, I., et al. Numbers, Information and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6048-4_33
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6048-4_33
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4967-7
Online ISBN: 978-1-4757-6048-4
eBook Packages: Springer Book Archive