On pseudorandom binary sequences constructed by using finite fields
From MaRDI portal
The author considers pseudorandom binary sequences constructed by finite fields and their quadratic characters. The results provide upper bounds for the well-distribution measure, for the correlation measure of order \(k\) and for the so-called \(PR\)-measure of order \(k\). In a first part a useful survey on results of Mauduit-Sárközy, Sárközy-Winterhof and of Gyarmati is presented. The second part contains extensions of Gyarmati's result and a sharpening of estimates due to Sárközy and Winterhof. The paper concludes with a list of open problems in this field.
Recommendations
- Measures of pseudorandomness for binary sequences constructed using finite fields
- On the measures of pseudorandomness of binary sequences.
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
- A construction of pseudorandom binary sequences using rational functions
Cites work
- A note on certain modular constructions of pseudorandom binary sequences with composite moduli
- Construction of large families of pseudorandom binary sequences
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Construction of pseudorandom binary sequences using additive characters over GF(2ᵏ). II
- scientific article; zbMATH DE number 2051161 (Why is no real title available?)
- scientific article; zbMATH DE number 2208523 (Why is no real title available?)
- scientific article; zbMATH DE number 3055095 (Why is no real title available?)
- Linear complexity profile of binary sequences with small correlation measure
- Measures of pseudorandomness
- Measures of pseudorandomness for binary sequences constructed using finite fields
- Measures of pseudorandomness for finite sequences: typical values
- Measures of pseudorandomness of binary lattices. III: Q_k, correlation, normality, minimal values)
- Modular constructions of pseudorandom binary sequences with composite moduli
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On pseudorandom binary lattices
- On the correlation of pseudorandom binary sequences with composite moduli
- On the correlation of subsequences
- On the measures of pseudorandomness of binary sequences.
- Pseudo-randomness of certain sequences of k symbols with length pq
- Pseudorandom binary sequences with composite moduli
- Some estimates for character sums and applications
Cited in
(19)- Measures of pseudorandomness for binary sequences constructed using finite fields
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Improving results on the pseudorandomness of sequences generated via the additive order of a finite field
- More constructions of pseudorandom sequences of \(k\) symbols
- Modular constructions of pseudorandom binary sequences with composite moduli
- scientific article; zbMATH DE number 426145 (Why is no real title available?)
- A construction of pseudorandom binary sequences using rational functions
- On finite pseudorandom binary sequences IV: The Liouville function, II
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- A note on certain modular constructions of pseudorandom binary sequences with composite moduli
- scientific article; zbMATH DE number 7594564 (Why is no real title available?)
- On linear recursion and pseudorandomness
- A family of pseudorandom binary sequences constructed by the multiplicative inverse
- Measures of pseudorandomness
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Construction of pseudorandom binary sequences using additive characters over GF(2ᵏ). II
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
- Constructing new covering arrays from LFSR sequences over finite fields
- Finite binary sequences constructed by explicit inversive methods
This page was built for publication: On pseudorandom binary sequences constructed by using finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313474)
