Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the estimation of the periods of noisy binary periodic sequences
-
M. I. Tikhomirova
Veröffentlicht/Copyright:
19. Oktober 2009
Abstract
For estimation of the lengths of periods of noisy binary sequences we suggest and investigate statistics equal to the logarithm of the goodness-of-fit functions and functions close to them.
Received: 2006-09-14
Published Online: 2009-10-19
Published in Print: 2009-October
© de Gruyter 2009
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- On the limit distributions of the vertex degrees of conditional Internet graphs
- On the estimation of the periods of noisy binary periodic sequences
- On a constructive approach to the calculation of cardinality of the Ryser classes
- Positively closed classes of three-valued logic generated by one-place functions
- On combinatorial Gray codes with distance 3
- Optimal paths in oriented graphs and eigenvectors in max-⊗ systems
- The factorisation of one-generated partially foliated formations
- On finite lattices of topologies of commutative unary algebras
Artikel in diesem Heft
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- On the limit distributions of the vertex degrees of conditional Internet graphs
- On the estimation of the periods of noisy binary periodic sequences
- On a constructive approach to the calculation of cardinality of the Ryser classes
- Positively closed classes of three-valued logic generated by one-place functions
- On combinatorial Gray codes with distance 3
- Optimal paths in oriented graphs and eigenvectors in max-⊗ systems
- The factorisation of one-generated partially foliated formations
- On finite lattices of topologies of commutative unary algebras
