Construction of pseudorandom binary sequences using additive characters over GF(2ᵏ)
From MaRDI portal
Publication:1046743
DOI10.1007/S10998-008-7073-1zbMATH Open1199.68129OpenAlexW2038931052MaRDI QIDQ1046743FDOQ1046743
Authors: János Folláth 
Publication date: 28 December 2009
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-008-7073-1
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
- A complexity measure for families of binary sequences
- Algebraic coding theory
- Title not available (Why is that?)
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Construction of large families of pseudorandom binary sequences
- Title not available (Why is that?)
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Equations over finite fields. An elementary approach
- Construction of pseudorandom binary sequences using additive characters
- Linear complexity profile of binary sequences with small correlation measure
- On linear recursion and pseudorandomness
- A finite pseudorandom binary sequence
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Estimates for Character Sums
- Collision and avalanche effect in families of pseudorandom binary sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
