On the estimation of the periods of noisy binary periodic sequences

Articles in the same Issue

1. On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
2. On the limit distributions of the vertex degrees of conditional Internet graphs
3. On the estimation of the periods of noisy binary periodic sequences
4. On a constructive approach to the calculation of cardinality of the Ryser classes
5. Positively closed classes of three-valued logic generated by one-place functions
6. On combinatorial Gray codes with distance 3
7. Optimal paths in oriented graphs and eigenvectors in max-⊗ systems
8. The factorisation of one-generated partially foliated formations
9. On finite lattices of topologies of commutative unary algebras