Construction of pseudorandom binary sequences using additive characters over GF(2ᵏ)
From MaRDI portal
(Redirected from Publication:1046743)
Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
Recommendations
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- Construction of pseudorandom binary sequences using additive characters
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- On the correlation of pseudorandom binary sequences using additive characters
- Construction of pseudorandom binary lattices based on multiplicative characters
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- On pseudorandom binary sequences constructed by using finite fields
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Construction of large families of pseudorandom binary sequences
- Construction of large families of pseudorandom binary sequences
Cites work
- scientific article; zbMATH DE number 1588467 (Why is no real title available?)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2097428 (Why is no real title available?)
- A complexity measure for families of binary sequences
- A finite pseudorandom binary sequence
- Algebraic coding theory
- Collision and avalanche effect in families of pseudorandom binary sequences
- Construction of large families of pseudorandom binary sequences
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Construction of pseudorandom binary sequences using additive characters
- Equations over finite fields. An elementary approach
- Estimates for Character Sums
- Linear complexity profile of binary sequences with small correlation measure
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On linear recursion and pseudorandomness
Cited in
(10)- Family complexity and VC-dimension
- On pseudorandom binary sequences constructed by using finite fields
- Pseudorandomness of binary sequences derived from linear recursions
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- A new class of pseudo-random sequences from Mersenne numbers
- Measures of pseudorandomness: arithmetic autocorrelation and correlation measure
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- Construction of pseudorandom binary sequences using additive characters
- On pseudorandomness of families of binary sequences
This page was built for publication: Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046743)
