Universal Coding of Non-Prefix Context Tree Sources
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.
KeywordsConditional Probability Markov Chain Model Minimal Description Length Sequential Estimation Conditional Probability Distribution
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- B.Ya. Ryabko, “Twice-Universal Coding”, Probl. Inform. Trans., vol. 20, no. 4, 1984, 396–402.Google Scholar
- Yu.M. Shtarkov, “Aim Functions and Sequential Estimation of Source Model for Universal Coding”, Probl. Inform. Trans., vol. 35, no. 3, 1999.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar