Concatenation of pseudorandom binary sequences
From MaRDI portal
Publication:1046758
DOI10.1007/S10998-009-9099-XzbMath1197.11094OpenAlexW2036626556MaRDI QIDQ1046758
Publication date: 28 December 2009
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-009-9099-x
Related Items (4)
A new lower bound on the family complexity of Legendre sequences ⋮ On the correlation of families of pseudorandom sequences of $k$ symbols ⋮ Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II ⋮ On the complexity of a family of Legendre sequences with irreducible polynomials
Cites Work
- Unnamed Item
- Collision and avalanche effect in families of pseudorandom binary sequences
- A technique to study the correlation measures of binary sequences
- A complexity measure for families of binary sequences
- Construction of pseudorandom binary sequences using additive characters
- Modular constructions of pseudorandom binary sequences with composite moduli
- On a family of pseudorandom binary sequences
- Probabilistic Algorithms in Finite Fields
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On linear recursion and pseudorandomness
- On a Fast Version of a Pseudorandom Generator
- Fast construction of irreducible polynomials over finite fields
- Construction of large families of pseudorandom binary sequences
This page was built for publication: Concatenation of pseudorandom binary sequences
