On pseudorandom binary sequences constructed by using finite fields
From MaRDI portal
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
- 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?)
- 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^k)\). II
- 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)- scientific article; zbMATH DE number 426145 (Why is no real title available?)
- Improving results on the pseudorandomness of sequences generated via the additive order of a finite field
- scientific article; zbMATH DE number 7594564 (Why is no real title available?)
- Modular constructions of pseudorandom binary sequences with composite moduli
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
- Measures of pseudorandomness
- A family of pseudorandom binary sequences constructed by the multiplicative inverse
- On finite pseudorandom binary sequences IV: The Liouville function, II
- Measures of pseudorandomness for binary sequences constructed using finite fields
- Constructing new covering arrays from LFSR sequences over finite fields
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- More constructions of pseudorandom sequences of \(k\) symbols
- Finite binary sequences constructed by explicit inversive methods
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- A construction of pseudorandom binary sequences using rational functions
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- A note on certain modular constructions of pseudorandom binary sequences with composite moduli
- On linear recursion and pseudorandomness
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)
