Additive character sums of polynomial quotients
Let \(p\) be a prime number, \(f(x) \in\mathbb Z[x]\) a polynomial with leading coefficient not divisible by \(p\), and \(R\) a complete residue system modulo \(p\). For an integer \(u\) the authors define the polynomial quotient \(q_{f,p,R}(u)\) by NEWLINE\[NEWLINE q_{f,p,R}(u)= \frac{f(u)-f_{p,r}(u)}{p} \pmod p, \quad 0 < q_{f,p,R}(u) < p, NEWLINE\]NEWLINE where \(f_{p,R}(u) \equiv f(u)\pmod p\), \(f_{p,R}(u) \in R\), and then find an upper bound for the additive character sums NEWLINE\[NEWLINE \sum_{u=M+1}^{M+N} \psi \left( \sum_{j=0}^{s-1}a_{j}q_{f,p,R}(u+j)\right), \quad 1 \leq s \leq \deg(f), NEWLINE\]NEWLINE which is non-trivial for any \(N \geq \deg(f)p \log p\). This extends a series of earlier results concerning the well-studied Fermat quotient NEWLINE\[NEWLINE q_{p}(u)= \frac{u^{p-1}-u^{p(p-1)}}{p} \pmod p. NEWLINE\]NEWLINE In addition, for \(s=1\) and NEWLINE\[NEWLINE q_{p}(u) \equiv \frac{u^{w}-u^{pw}}{p} \pmod pNEWLINE\]NEWLINE with a large \(\gcd(w,p-1)\) the authors obtain much stronger bounds by a reduction to the well-known Burgess bound.NEWLINENEWLINEFor the entire collection see [Zbl 1253.00023].
- A search for Wieferich and Wilson primes
- Additive character sums of polynomial quotients
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Autocorrelation values of generalized cyclotomic sequences of order two
- Boolean functions derived from Fermat quotients
- Bounds of multiplicative character sums with Fermat quotients of primes
- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
- Character sums with Fermat quotients
- Distribution of values of polynomial Fermat quotients
- Fermat quotients for composite moduli
- Fermat quotients: exponential sums, value set and primitive roots
- How many bits have to be changed to decrease the linear complexity?
- scientific article; zbMATH DE number 3616509 (Why is no real title available?)
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Interpolation of Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Linear complexity of binary sequences derived from polynomial quotients
- Linear complexity of generalized cyclotomic binary sequences of order 2
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
- On the divisibility of Fermat quotients
- On the k-error linear complexity of cyclotomic sequences
- On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
- On the value set of Fermat quotients
- On the 𝑝-divisibility of Fermat quotients
- One-Error Linear Complexity over F p of Sidelnikov Sequences
- Permutation polynomials, de Bruijn sequences, and linear complexity
- Properties of the Error Linear Complexity Spectrum
- Pseudorandomness and dynamics of Fermat quotients
- Shift-register synthesis and BCH decoding
- Short character sums with Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- The arithmetic of Carmichael quotients
- The stability theory of stream ciphers
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- Additive character sums of polynomial quotients
- Bounds of multiplicative character sums with Fermat quotients of primes
- Character sums with Fermat quotients
- Short character sums with Fermat quotients
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Interpolation of Fermat quotients
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- Polynomial quotients: Interpolation, value sets and Waring's problem
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- Additive energy of polynomial images
- Trace representation of pseudorandom binary sequences derived from Euler quotients
This page was built for publication: Additive character sums of polynomial quotients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869127)
