Measures of pseudorandomness for binary sequences constructed using finite fields
The definition of measures of pseudorandomness (i.e. the well-distribution measure and the correlation measure) introduced by \textit{C. Mauduit} and \textit{A. Sárközy} [Acta Arith. 82, No. 4, 365--377 (1997; Zbl 0886.11048)] is extended from binary sequences to binary functions defined on sets which can be ordered, in two ways (classical and modified), and the sequences of quadratic characters of finite fields of prime power order are analyzed by use of the two definitions, extending the results of \textit{L. Goubin}, \textit{C. Mauduit} and \textit{A. Sárközy} [J. Number Theory 106, No. 1, 56--69 (2004; Zbl 1049.11089)].
- On pseudorandom binary sequences constructed by using finite fields
- Pseudorandomness of binary sequences derived from linear recursions
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Construction of pseudorandom binary sequences using additive characters over GF(2ᵏ). II
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Construction of large families of pseudorandom binary sequences
- scientific article; zbMATH DE number 2127885 (Why is no real title available?)
- scientific article; zbMATH DE number 2124947 (Why is no real title available?)
- scientific article; zbMATH DE number 5247160 (Why is no real title available?)
- Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
- Lower bounds on the linear complexity of the discrete logarithm in finite fields
- Measures of pseudorandomness for finite sequences: typical values
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On the distribution of powers in finite fields
- On the measures of pseudorandomness of binary sequences.
- Some estimates for character sums and applications
- On the measures of pseudorandomness of binary sequences.
- Finite and infinite pseudorandom binary words
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
- Improving results on the pseudorandomness of sequences generated via the additive order of a finite field
- On pseudorandom properties of some Dirichlet characters
- On the pseudorandomness of the Liouville function of polynomials over a finite field
- Measures of pseudorandomness of finite binary lattices, I. The measures Qk, normality
- Pseudorandomness of binary sequences derived from linear recursions
- On pseudorandom binary sequences constructed by using finite fields
- scientific article; zbMATH DE number 426145 (Why is no real title available?)
- Multiplicative character sums of a class of nonlinear recurrence vector sequences
- scientific article; zbMATH DE number 5619271 (Why is no real title available?)
- scientific article; zbMATH DE number 3942590 (Why is no real title available?)
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- scientific article; zbMATH DE number 2051161 (Why is no real title available?)
- A finite pseudorandom binary sequence
- On the pseudorandomness of quaternary sequences derived from sequences over \(\mathbb{F}_4\)
- On linear recursion and pseudorandomness
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- On Pseudorandom Sequences and Their Application
- Random polynomials in Legendre symbol sequences
- Construction of pseudorandom binary sequences using additive characters over GF(2ᵏ). II
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
This page was built for publication: Measures of pseudorandomness for binary sequences constructed using finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024437)
