|
This article is cited in 1 scientific paper (total in 1 paper)
Applied Theory of Coding, Automata and Graphs
Finite-state generators with maximal period
E. S. Prudnikov Tomsk State University
Abstract:
The periodic properties of a two-stage finite-state generator G=A1⋅A2 are studied, where A1=(Fn2,F2,g1,f1) (it is autonomous), A2=(F2,Fm2,F2,g2,f2), n,m≥1. Some necessary conditions for such a generator with the maximum period are formulated, namely: 1) the output sequence of A1 is purely periodic and the period length is 2n; 2) the function f1 has an odd weigth; 3) substitutions g(0,⋅) and g(1,⋅) have different parities. Some sufficient conditions have been also formulated, for example, the function g2(u,y) must be injective in u and the weigth of the function f2 must be odd. A method for constructing a generator having maximum period has been proposed.
Keywords:
finite-state generator, maximum period, substitutions.
Citation:
E. S. Prudnikov, “Finite-state generators with maximal period”, Prikl. Diskr. Mat. Suppl., 2024, no. 17, 152–154
Linking options:
https://www.mathnet.ru/eng/pdma669 https://www.mathnet.ru/eng/pdma/y2024/i17/p152
|
Statistics & downloads: |
Abstract page: | 81 | Full-text PDF : | 27 | References: | 19 |
|