Skip to main content
SpringerLink
Log in

Checking the Randomness of Bits Disposition in Local Segments of the (0, 1)-Sequence

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

An explicit form of the joint distribution of the number of 2-strings and the number of 3-strings of various fixed variants in a (0, 1)-sequence of length n consisting of zeros and ones is established. Elements of (0, 1)-sequences are assumed to be independent equally distributed random variables. The tables illustrating application of established formulas for (0, 1)-sequences of length n = 16 are provided.

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. A. Rukhin, J. Soto, J. Nechvatal, M. Smid, E. Barker, S. Leigh, M. Levenson, M. Vangel, D. Banks, A. Heckert, J. Dray, and S. Vo, “A statistical test suite for random and pseudorandom number generators for cryptographic applications,” National Institute of Standards and Technology, Special Publication 800-22 revision 1a (2010).

  2. G. I. Ivchenko and Yu. I. Medvedev, An Introduction to Mathematical Statistics [in Russian], Izd. LKI, Moscow (2010).

  3. N. K. Vereshchagin, V. A. Uspenskii, and A. Shen, Kolmogorov Complexity and Algorithmic Randomness [in Russian], MTsNMO, Moscow (2013).

  4. V. N. Kotov, Applying the Measurement Theory to Biological Studies [in Russian], Naukova Dumka, Kyiv (1985).

  5. Yu. S. Kharin, V. I. Bernik, G. V. Matveev, and S. V. Agievich, Mathematical and Computer Fundamentals of Cryptology [in Russian], Novoe Znanie, Minsk (2003).

  6. P. F. Belyaev, “Joint frequency distribution of long s-strings in simple homogeneous Markov chains having a finite set of outcomes,” Trans. Discrete Math., Vol. 1, 19–42 (1997).

    MATH  Google Scholar 

  7. V. G. Mikhaylov, “Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain,” Discrete Math. Appl., Vol. 26, No. 2, 105–113 (2016).

    Article  MathSciNet  Google Scholar 

  8. M. I. Tikhomirova and V. P. Chistyakov, “On the asymptotic behaviour of moments of the number of absent s-tuples,” Discrete Math. Appl., Vol. 7, No. 1, 13–31 (1997).

    Article  MathSciNet  Google Scholar 

  9. V. P. Chistyakov and M. I. Tikhomirov, “Statistical criteria constructed based on frequencies s-grams from some set,” Trans. Discrete Math., Vol. 3, 295–302 (2000).

    Google Scholar 

  10. V. G. Mikhailov, “Some inequalities for the distribution function of the number of not appeared s-strings,” Trans. Discrete Math., Vol. 1, 221–226 (1997).

    Google Scholar 

  11. V. G. Mikhailov, “Inequalities for the average number of repetitions of m-strings and for the average number of not appeared m-strings of the given class,” Trans. Discrete Math., Vol. 3, 147–154 (2000).

    Google Scholar 

  12. V. I. Masol, “Distribution of some statistics of (0, 1)-vector,” Issled. Operatsii i ASU, Issue 29, 23–27 (1987).

  13. I. P. Gaidyshev, AtteStat Data Analysis Software: A User’s Guide, Version 13 (2012).

  14. Y. Hu, T. Polk, J. Yang, Y. Zhao, and Sh. Liu, “Spot-tracking lens: A zoomable user interface for animated bubble charts,” 2016 IEEE Pacific Visualization Symposium (PacificVis), Taipei, Taiwan, Vol. 1 (2016), pp. 16–23.

Download references

Author information

Authors and Affiliations

  1. Taras Shevchenko National University of Kyiv, Kyiv, Ukraine

    V. I. Masol & S. V. Popereshnyak

Authors
  1. V. I. Masol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. V. Popereshnyak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. I. Masol.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2020, pp. 194–202.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Masol, V.I., Popereshnyak, S.V. Checking the Randomness of Bits Disposition in Local Segments of the (0, 1)-Sequence. Cybern Syst Anal 56, 513–520 (2020). https://doi.org/10.1007/s10559-020-00267-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-020-00267-0

Keywords

Search

Navigation