Pages that link to "Item:Q624254"
From MaRDI portal
The following pages link to Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II (Q624254):
Displayed 6 items.
- Pseudorandomness of binary sequences derived from linear recursions (Q313462) (← links)
- On pseudorandom binary sequences constructed by using finite fields (Q313474) (← links)
- On pseudorandomness of families of binary sequences (Q516796) (← links)
- On the complexity of a family of Legendre sequences with irreducible polynomials (Q2011490) (← links)
- A new lower bound on the family complexity of Legendre sequences (Q2121576) (← links)
- Family Complexity and VC-Dimension (Q4915244) (← links)