Add to ORKGAbstract. We prove a new bound for multiplicative character sums of nonlinear recurring sequences with Rédei functions over a finite field of prime order. This result is motivated by earlier results on nonlinear recurring sequences and their application to the distribution of powers and primitive elements. The new bound is much stronger than the bound known for general nonlinear recurring sequences.
In this thesis, the reader is provided with a self-contained study of multiplicative charactersmodul...
Let u? be an integer of multiplicative order t ? 1 modulo a prime p. Sums of the form Sf (p, t, a) =...
AbstractConsider an extension field Fqm=Fq(α) of the finite field Fq. Davenport proved that the set ...
It is shown that the method of estimation of exponential sums with nonlinear recurring sequences, in...
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over ...
AbstractWe prove a new bound on exponential sums for nonlinear recurring sequences. This result impr...
AbstractWe obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequenc...
Abstract. Nonlinear congruential pseudorandom number generators can have unexpectedly short periods....
We estimate multiplicative character sums along the orbits of a class of nonlinear recurrence vector...
We prove some new bounds on exponential sums for nonlinear re-curring sequences over residue rings. ...
AbstractThe nonlinear congruential method is an attractive alternative to the classical linear congr...
In this dissertation, I discuss bounds for the set of possible number of zeros of a homogeneous line...
Some new results on the distribution of recurring sequences in finite fields and the Bell numbers B(...
This thesis deals with fundamental concepts of linear recurring sequences over the finite fields. Th...
International audienceIn Fq, Dartyge and Sarkozy introduced the notion of digits and studied some pr...
In this thesis, the reader is provided with a self-contained study of multiplicative charactersmodul...
Let u? be an integer of multiplicative order t ? 1 modulo a prime p. Sums of the form Sf (p, t, a) =...
AbstractConsider an extension field Fqm=Fq(α) of the finite field Fq. Davenport proved that the set ...
It is shown that the method of estimation of exponential sums with nonlinear recurring sequences, in...
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over ...
AbstractWe prove a new bound on exponential sums for nonlinear recurring sequences. This result impr...
AbstractWe obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequenc...
Abstract. Nonlinear congruential pseudorandom number generators can have unexpectedly short periods....
We estimate multiplicative character sums along the orbits of a class of nonlinear recurrence vector...
We prove some new bounds on exponential sums for nonlinear re-curring sequences over residue rings. ...
AbstractThe nonlinear congruential method is an attractive alternative to the classical linear congr...
In this dissertation, I discuss bounds for the set of possible number of zeros of a homogeneous line...
Some new results on the distribution of recurring sequences in finite fields and the Bell numbers B(...
This thesis deals with fundamental concepts of linear recurring sequences over the finite fields. Th...
International audienceIn Fq, Dartyge and Sarkozy introduced the notion of digits and studied some pr...
In this thesis, the reader is provided with a self-contained study of multiplicative charactersmodul...
Let u? be an integer of multiplicative order t ? 1 modulo a prime p. Sums of the form Sf (p, t, a) =...
AbstractConsider an extension field Fqm=Fq(α) of the finite field Fq. Davenport proved that the set ...