Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
From MaRDI portal
Publication:624254
DOI10.1007/S10998-010-2127-YzbMath1224.68030OpenAlexW1985587200MaRDI QIDQ624254
Publication date: 8 February 2011
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-010-2127-y
Related Items (6)
A new lower bound on the family complexity of Legendre sequences ⋮ Pseudorandomness of binary sequences derived from linear recursions ⋮ On pseudorandom binary sequences constructed by using finite fields ⋮ On pseudorandomness of families of binary sequences ⋮ Family Complexity and VC-Dimension ⋮ On the complexity of a family of Legendre sequences with irreducible polynomials
Cites Work
- Collision and avalanche effect in families of pseudorandom binary sequences
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Concatenation of pseudorandom binary sequences
- A complexity measure for families of binary sequences
- Linear complexity profile of binary sequences with small correlation measure
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Construction of large families of pseudorandom binary sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II