Skip to main content
SpringerLink
Log in

Coding of Moore and Mealy Sources by Nonequivalent Symbols at Unknown Message Statistics

  • Published:
Optoelectronics, Instrumentation and Data Processing Aims and scope

Abstract

Redundancy of the universal coding by nonequivalent symbols for Markov sources given by matrices of transient probabilities with a fixed number of different rows is found. As a consequence, the estimates of redundancy for Markov sources with memory \(s\) and for Mealy Markov sources given by a graph are obtained. The rate of decrease in redundancy dependent on the graph characteristics, the length of the coded unit, and the channel bandwidth capacity is established.

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. K. Shannon, A Mathematical Theory of Communication The Bell Syst. Tech. J. 27, 379–423 (1948). https://doi.org/10.1002/j.1538-7305.1948.tb01338.x

  2. R. Gallager, Information Theory and Reliable Communication (Springer, Vienna, 1972). https://doi.org/10.1007/978-3-7091-2945-6

  3. V. M. Glushkov, Synthesis of Digital Automata (Gos. Izd. Fiz.-Mat. Lit., Moscow, 1962).

    Google Scholar 

  4. A. L. Reznik, A. A. Solov’ev, and A. V. Torgov, ‘‘Localization of random pulse point sources using physically implementable search algorithms,’’ Optoelectron., Instrum. Data Process. 56, 598–607 (2020). https://doi.org/10.3103/S8756699020060114

    Article  ADS  Google Scholar 

  5. B. Yu. Lemeshko and S. B. Lemeshko, ‘‘Effect of the roundoff on the properties of criteria for testing statistical hypotheses,’’ Optoelectron., Instrum. Data Process. 56, 242–250 (2020). https://doi.org/10.3103/S8756699020030103

    Article  ADS  Google Scholar 

  6. B. M. Fitingof, ‘‘Optimal coding in the case of unknown and changing message statistics,’’ Probl. Inf. Transm. 2 (2), 1–7 (1966).

    MathSciNet  Google Scholar 

  7. R. E. Krichevsky, ‘‘The relation between redundancy coding and the reliability of information from a source,’’ Probl. Inf. Transm. 4 (3), 37–45 (1968).

    MathSciNet  Google Scholar 

  8. V. K. Trofimov, ‘‘Redundancy of universal coding of arbitrary Markov sources,’’ Probl. Inf. Transm. 10, 289–295 (1974).

    MathSciNet  Google Scholar 

  9. Yu. M. Shtar’kov, Universal Coding: Theory and Algorithms (Izd. Mat. Lit, Moscow, 2013).

    Google Scholar 

  10. R. Krichevsky and V. Trofimov, ‘‘The performance of universal encoding,’’ IEEE Trans. Inf. Theory 27, 199–207 (1981). https://doi.org/10.1109/TIT.1981.1056331

    Article  MathSciNet  MATH  Google Scholar 

  11. L. D. Davisson, ‘‘Universal noiseless coding,’’ IEEE Trans. Inf. Theory 19, 783–795 (1973). https://doi.org/10.1109/TIT.1973.1055092

    Article  MathSciNet  MATH  Google Scholar 

  12. Yu. M. Shtar’kov, ‘‘Generalized Shannon codes,’’ Probl. Inf. Transm. 20, 155–167 (1984).

    MathSciNet  MATH  Google Scholar 

  13. Yu. M. Shtarkov, Tj. J. Tjalkens, and F. M. J. Willems, ‘‘Optimal universal coding with respect to the maximal individual relative redundancy criterion,’’ Probl. Inf. Transm. 40, 90–101 (2004). https://doi.org/10.1023/B:PRIT.0000024884.79880.80

    Article  MathSciNet  Google Scholar 

  14. R. E. Krichevsky and V. K. Trofimov, ‘‘Redundancy of universal coding,’’ Preprint, IM SO AN SSSR (Institute of Mathematics, Sib. Otd. Akad. Nauk SSSR, Novosibirsk, 1981).

  15. V. K. Trofimov and T. V. Khramova, ‘‘Compression of information generated by an unknown memoryless source by nonequivalent symbols,’’ Optoelectron., Instrum. Data Process. 48, 24–36 (2012). https://doi.org/10.3103/S8756699012010049

    Article  Google Scholar 

  16. T. V. Khramova and V. K. Trofimov, ‘‘Compression of information generated by an unknown source,’’ Elektrosvyaz’, No. 4, 41–44 (2012).

  17. V. K. Trofimov and T. V. Khramova, ‘‘Universal encoding of Markov’s sources by symbols with varying durations,’’ Diskretn Anal. Issled. Oper. 20 (3), 71–83 (2013).

    MathSciNet  MATH  Google Scholar 

  18. S. V. Nagaev, ‘‘More exact statement of limit theorems for homogeneous Markov chains,’’ Theory Probab. Appl. 6, 62–81 (1961). https://doi.org/10.1137/1106005

    Article  MATH  Google Scholar 

  19. V. I. Romanovskii, Discrete Markov Chains (Gostekhizdat, Moscow, 1949).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siberian State University of Telecommunications and Information Science, 630102, Novosibirsk, Russia

    V. K. Trofimov & T. V. Khramova

  2. Ershov Institute of Informatics Systems,Siberian Branch, Russian Academy of Sciences, 630090, Novosibirsk, Russia

    V. K. Trofimov

Authors
  1. V. K. Trofimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. V. Khramova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. K. Trofimov or T. V. Khramova.

Additional information

Translated by E. Oborin

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Trofimov, V.K., Khramova, T.V. Coding of Moore and Mealy Sources by Nonequivalent Symbols at Unknown Message Statistics. Optoelectron.Instrument.Proc. 57, 167–176 (2021). https://doi.org/10.3103/S8756699021020138

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S8756699021020138

Keywords:

Search

Navigation