Construction of pseudorandom binary sequences using additive characters
From MaRDI portal
In earlier papers the authors constructed finite pseudorandom binary sequences by using multiplicative characters. In this paper they construct finite pseudorandom binary sequences by using additive characters. These sequences can be computed fast. It is proved that the well-distribution measures and the correlation measures of ``small order of the sequences are ``small. Moreover, they show that the correlations of ``large order can be ``large.
Recommendations
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- A construction of pseudorandom binary sequences using rational functions
- Construction of large families of pseudorandom binary sequences
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
Cited in
(39)- On pseudo-random subsets of \({\mathbb{Z}}_n\)
- Modified constructions of binary sequences using multiplicative inverse
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Concatenation of pseudorandom binary sequences
- On the correlation measures of subsets
- More constructions of pseudorandom lattices of \(k\) symbols
- Sequences related to Legendre/Jacobi sequences
- More constructions of pseudorandom sequences of \(k\) symbols
- Extension of the notion of collision and avalanche effect to sequences of \(k\) symbols
- Design of long period pseudo-random sequences from the addition of \(m\)-sequences over \({\mathbb F}_p\)
- The truncated sum-of-digits function of powers
- On the symmetry measure of pseudorandom subsets
- On the correlation of pseudorandom binary sequences using additive characters
- Pseudorandomness of binary sequences derived from linear recursions
- Gowers uniformity norm and pseudorandom measures of the pseudorandom binary sequences
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- A construction of pseudorandom binary sequences using rational functions
- On the correlation of families of pseudorandom sequences of \(k\) symbols
- Large families of pseudorandom sequences of k symbols and their complexity, Part II
- Large families of pseudorandom sequences of k symbols and their complexity, Part I
- A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
- A large family of pseudorandom binary lattices
- Elliptic curve analogues of a pseudorandom generator
- A note on certain modular constructions of pseudorandom binary sequences with composite moduli
- On the complexity of families of pseudo-random subsets
- On pseudorandomness of families of binary sequences
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- Construction of large families of pseudorandom binary sequences
- Construction of large families of pseudorandom binary sequences
- Kloosterman sums with Beatty sequences and application
- Construction of pseudorandom binary sequences using additive characters over GF(2ᵏ). II
- Binary sequence family with both small cross-correlation and large family complexity
- Correlation measures of binary sequences using additive characters
- Bounds for exponential sums over integers with restricted digits
- On a problem of D.H. Lehmer and pseudorandom binary sequences
- Elliptic curve analogue of Legendre sequences
- Finite binary sequences constructed by explicit inversive methods
- On large families of subsets of the set of the integers not exceeding \(N\)
- Construction of pseudorandom binary lattices based on multiplicative characters
This page was built for publication: Construction of pseudorandom binary sequences using additive characters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881645)
