2019
DOI: 10.33048/semi.2019.16.014
|View full text |Cite
|
Sign up to set email alerts
|

On the number of ones in the cycle of multicycliс sequence determined by Boolean function

Abstract: The paper presents formulas that denote the relationship between the number of ones in the cycle of a multicyclic sequence modulo 2, defined by the Boolean function, and the number of ones in the registers of the generator through the spectral characteristics of this function. Using these formulas, we prove normal-type limit theorems for the number of ones in the cycle of the multicyclic sequence if the registers are filled with independent binary random variables with the same distributions within each regist… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 2 publications
0
4
0
Order By: Relevance
“…The present research completes and summarizes a series of research papers by the authors.The generalization of the results of Mezhennaya and Mikhailov [6,7] for the limit distribution the number ξ of 1's per cycle of the random binary multicyclic sequence determined by Boolean function is obtained. The conditions of the limit theorem contain only the assumption that the numbers of 1's in each of the vectors x 1 , .…”
Section: Resultsmentioning
confidence: 75%
See 3 more Smart Citations
“…The present research completes and summarizes a series of research papers by the authors.The generalization of the results of Mezhennaya and Mikhailov [6,7] for the limit distribution the number ξ of 1's per cycle of the random binary multicyclic sequence determined by Boolean function is obtained. The conditions of the limit theorem contain only the assumption that the numbers of 1's in each of the vectors x 1 , .…”
Section: Resultsmentioning
confidence: 75%
“….⊕y r ) was derived by Mezhennaya and Mikhailov [5]. In the general case (for arbitrary f ), the corresponding formula was obtained by Mezhennaya and Mikhailov [6,7]. Bilyak and Kamlovskii [1,2] got a similar result for the output sequence of the combining generator.…”
Section: Introductionmentioning
confidence: 78%
See 2 more Smart Citations