Family complexity and cross-correlation measure for families of binary sequences

DOI10.1007/s11139-014-9649-5zbMath1414.11089arXiv1408.4980OpenAlexW2094626482MaRDI QIDQ265595

Arne Winterhof, Oğuz Yayla

Publication date: 4 April 2016

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.4980

zbMATH Keywords

binary sequencescross-correlation measurefamily complexityLegendre sequencepolynomials over finite fieldspseudorandomness

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (4)

A new lower bound on the family complexity of Legendre sequences ⋮ Families of Pseudorandom Binary Sequences with Low Cross-Correlation Measure ⋮ On pseudorandomness of families of binary sequences ⋮ On the complexity of a family of Legendre sequences with irreducible polynomials

Cites Work

• On the complexity of a family related to the Legendre symbol
• A complexity measure for families of binary sequences
• On the complexity of a family of Legendre sequences with irreducible polynomials
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Construction of large families of pseudorandom binary sequences
• Some estimates for character sums and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Family complexity and cross-correlation measure for families of binary sequences