On finite pseudorandom binary lattices
From MaRDI portal
Publication:516785
DOI10.1016/j.dam.2015.07.012zbMath1372.11082OpenAlexW1570067653MaRDI QIDQ516785
Katalin Gyarmati, Christian Mauduit, András Sárközy
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.012
Related Items
Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields ⋮ Multidimensional linear complexity analysis of periodic arrays ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the linear complexity of binary lattices
- On linear complexity of binary lattices. II
- Measures of pseudorandomness of finite binary lattices. II: The symmetry measures
- On new measures of pseudorandomness of binary lattices
- Construction of pseudorandom binary lattices based on multiplicative characters
- La conjecture de Weil. II
- On a pseudorandom property of binary sequences
- La conjecture de Weil. I
- A complexity measure for families of binary sequences
- On pseudorandom properties of some Dirichlet characters
- Construction of pseudorandom binary lattices by using the multiplicative inverse
- On a family of pseudorandom binary sequences
- Character sums and primitive roots in finite fields
- Handbook of Finite Fields
- Measures of pseudorandomness of families of binary lattices, I (Definitions, a construction using quadratic characters)
- Measures of pseudorandomness of finite binary lattices, I. The measures Qk, normality
- Construction of pseudorandom binary lattices using elliptic curves
- On pseudorandom binary lattices
- Pseudorandom binary sequences and lattices
- A large family of pseudorandom binary lattices
- Linear Complexity and Random Sequences
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- A finite pseudorandom binary sequence
- Large families of pseudorandom binary sequences and lattices by using the multiplicative inverse
- Remark concerning integer sequences
- Measures of pseudorandomness for finite sequences: typical values
- Estimates for Nonsingular Mixed Character Sums
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
- On a Fast Version of a Pseudorandom Generator
- Shift-register synthesis and BCH decoding
- Construction of large families of pseudorandom binary sequences
- Construction of large families of pseudorandom binary sequences
- Some estimates for character sums and applications
- On finite pseudorandom lattices of \(k\) symbols
