Binary sequence family with both small cross-correlation and large family complexity

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Polynomials over finite fields (11T06) Other character sums and Gauss sums (11T24) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Family complexity and cross-correlation measure for families of binary sequences
On the typical values of the cross-correlation measure
The cross-correlation measure of families of finite binary sequences: limiting distributions and minimal values
On pseudorandomness of families of binary sequences
On the complexity of a family related to the Legendre symbol
A complexity measure for families of binary sequences
Construction of pseudorandom binary sequences using additive characters
On finite pseudorandom binary sequences. V: On \((n\alpha)\) and \((n^2\alpha)\) sequences
On the complexity of a family of Legendre sequences with irreducible polynomials
A new lower bound on the family complexity of Legendre sequences
Modular constructions of pseudorandom binary sequences with composite moduli
A family of elliptic curve pseudorandom binary sequences
On a family of pseudorandom binary sequences
Construction of pseudorandom binary sequences by using the multiplicative inverse
The cross-correlation measure for families of binary sequences
Large families of pseudorandom binary sequences constructed by using the Legendre symbol
GOWERS UNIFORMITY NORM AND PSEUDORANDOM MEASURES OF THE PSEUDORANDOM BINARY SEQUENCES
The strong primitive normal basis theorem
On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
Primitive Normal Bases for Finite Fields
Large families of pseudorandom binary sequences and lattices by using the multiplicative inverse
Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
A family of pseudorandom binary sequences constructed by the multiplicative inverse
Construction of large families of pseudorandom binary sequences
On a trigonometric inequality of Vinogradov
Construction of large families of pseudorandom binary sequences

This page was built for publication: Binary sequence family with both small cross-correlation and large family complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565499)