On the complexity of a family of Legendre sequences with irreducible polynomials

DOI10.1016/J.FFA.2014.11.004zbMath1370.11095OpenAlexW2089462456MaRDI QIDQ2011490

Katalin Gyarmati

Publication date: 3 August 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2014.11.004

zbMATH Keywords

irreducible polynomialspseudorandom\(f\)-complexity

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (3)

Family complexity and cross-correlation measure for families of binary sequences ⋮ A new lower bound on the family complexity of Legendre sequences ⋮ On pseudorandomness of families of binary sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Family complexity and cross-correlation measure for families of binary sequences
• On the complexity of families of pseudo-random subsets
• On pseudorandomness of families of binary sequences
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
• Collision and avalanche effect in families of pseudorandom binary sequences
• Concatenation of pseudorandom binary sequences
• On the complexity of a family related to the Legendre symbol
• A complexity measure for families of binary sequences
• Measures of pseudorandomness of families of binary lattices, II (A further construction)
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Family Complexity and VC-Dimension
• Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
• Construction of large families of pseudorandom binary sequences

This page was built for publication: On the complexity of a family of Legendre sequences with irreducible polynomials