Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Estimates for the number of appearances of symbols on a segment of recurrent sequence over a finite field
-
V. M. SIDELNIKOV
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1992
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- On cardinality of the set of alternatives in discrete many-criterion problems
- Estimates for the number of appearances of symbols on a segment of recurrent sequence over a finite field
- A parallel algorithm of complexity O(log2n) for the set balancing problem
- Inequalities for functionals generated by bipartite graphs
- Combinatorial polynomials in the algebra of shift-commutative operators
- On lower bounds of sums of characters over the finite fields
- Integral limit theorems for lacunary distributions
- On limit theorems for decomposable statistics and efficiency of the corresponding statistical tests
- Hypercycles in a random hypergraph
Artikel in diesem Heft
- On cardinality of the set of alternatives in discrete many-criterion problems
- Estimates for the number of appearances of symbols on a segment of recurrent sequence over a finite field
- A parallel algorithm of complexity O(log2n) for the set balancing problem
- Inequalities for functionals generated by bipartite graphs
- Combinatorial polynomials in the algebra of shift-commutative operators
- On lower bounds of sums of characters over the finite fields
- Integral limit theorems for lacunary distributions
- On limit theorems for decomposable statistics and efficiency of the corresponding statistical tests
- Hypercycles in a random hypergraph
