Skip to main content
SpringerLink
Log in

Universal coding algorithm for a family of context Markov sources

  • Source Coding
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

Often, for a source to be encoded it is only known (or assumed) that its model belongs to some known family; parameters of models are unknown. The number of context Markov models in a family can be enormous, and methods for finding the best of them to describe a current block (message fragment of length n) have not been discussed previously. We propose a way to solve this problem and describe a coding algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Shtarkov, Yu.M., Universal Sequential Coding of Single Messages, Probl. Peredachi Inf., 1987, vol. 23, no. 3, pp. 3–17 [Probl. Inf. Trans. (Engl. Transl.), 1987, vol. 23, no. 3, pp. 175–186].

    MathSciNet  Google Scholar 

  2. Krichevsky, R.E. and Trofimov, V.K., The Performance of Universal Coding, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 2, pp. 199–207.

    Article  MathSciNet  MATH  Google Scholar 

  3. Shtarkov, Yu.M., Universal’noe kodirovanie. Teoriya i algoritmy (Universal Coding. Theory and Algorithms), Moscow: Fizmatlit, 2013.

    Google Scholar 

  4. Weinberger, M.J., Rissanen, J., and Feder, M., A Universal Finite State Memory Source, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 3, pp. 643–652.

    Article  MATH  Google Scholar 

  5. Shtarkov, Yu.M., Aim Functions and Sequential Estimation of the Source Model for Universal Coding, Probl. Peredachi Inf., 1999, vol. 35, no. 3, pp. 99–111 [Probl. Inf. Trans. (Engl. Transl.), 1999, vol. 35, no. 3, pp. 275–285].

    MathSciNet  Google Scholar 

  6. Willems, F., Shtarkov, Yu., and Tjalkens, T., The Context-Tree Weighting Method: Basic Properties, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 3, pp. 653–664.

    Article  MATH  Google Scholar 

  7. Shtarkov, Yu.M., Tjalkens, Tj.J., and Willems, F.M.J., Multialphabet Weighting Universal Coding of Context Tree Sources, Probl. Peredachi Inf., 1997, vol. 33, no. 1, pp. 21–34 [Probl. Inf. Trans. (Engl. Transl.), 1997, vol. 33, no. 1, pp. 17–28].

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    Yu. M. Shtarkov

Authors
  1. Yu. M. Shtarkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. M. Shtarkov.

Additional information

Original Russian Text © Yu.M. Shtarkov, 2014, published in Problemy Peredachi Informatsii, 2014, Vol. 50, No. 3, pp. 93–100.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shtarkov, Y.M. Universal coding algorithm for a family of context Markov sources. Probl Inf Transm 50, 285–291 (2014). https://doi.org/10.1134/S0032946014030077

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946014030077

Keywords

Search

Navigation