|
This article is cited in 11 scientific papers (total in 11 papers)
Formulas for the numbers of sequences containing a given pattern given number of times
A. A. Serov Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
Abstract:
Explicit recurrent formulas for the numbers of sequences containing a given pattern given number of times are constructed. These formulas depend on the length of the sequence, the length of the pattern and its period only. By means of these results one may find the distribution of statistics of the NIST overlapping matching test for binary sequences and arbitrary pattern parameters.
Keywords:
statistical tests, binary sequence, pattern (sequence segment), recurrence relations.
Received: 28.09.2020
Citation:
A. A. Serov, “Formulas for the numbers of sequences containing a given pattern given number of times”, Diskr. Mat., 32:4 (2020), 120–136; Discrete Math. Appl., 32:4 (2022), 233–245
Linking options:
https://www.mathnet.ru/eng/dm1626https://doi.org/10.4213/dm1626 https://www.mathnet.ru/eng/dm/v32/i4/p120
|
| Statistics & downloads: |
| Abstract page: | 395 | | Full-text PDF : | 456 | | References: | 67 | | First page: | 11 |
|