A finite pseudorandom binary sequence
From MaRDI portal
Recommendations
- Construction of large families of pseudorandom binary sequences
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
- More constructions of pseudorandom sequences of \(k\) symbols
- Measures of pseudorandomness for binary sequences constructed using finite fields
Cited in
(21)- Finite and infinite pseudorandom binary words
- Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Sequences related to Legendre/Jacobi sequences
- Construction of large families of pseudorandom binary sequences
- Pseudorandom sequences of binary vectors
- A new lower bound on the family complexity of Legendre sequences
- On pseudorandom properties of some Dirichlet characters
- On pseudorandomness in families of sequences derived from the Legendre symbol
- A complexity measure for families of binary sequences
- Elliptic curve analogues of a pseudorandom generator
- On a problem of D.H. Lehmer and pseudorandom binary sequences
- Construction of pseudorandom binary lattices based on multiplicative characters
- On the correlation measures of subsets
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- A large family of pseudorandom binary lattices
- Construction of pseudorandom binary lattices using elliptic curves
- On the complexity of families of pseudo-random subsets
- scientific article; zbMATH DE number 3273526 (Why is no real title available?)
- On finite pseudorandom binary lattices
- On the pseudo-randomness of subsets related to primitive roots
This page was built for publication: A finite pseudorandom binary sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780298)
