On pseudorandom sequences of k symbols constructed using finite fields
From MaRDI portal
Publication:744022
DOI10.1007/S00200-014-0224-5zbMATH Open1342.11068OpenAlexW2002915086MaRDI QIDQ744022FDOQ744022
Authors: Xiaoni Du, Zhixing Lin
Publication date: 2 October 2014
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-014-0224-5
Recommendations
- Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\)
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Large family of pseudorandom sequences of \(k\) symbols constructed by using multiplicative character
- On pseudorandom binary sequences constructed by using finite fields
- A large family of pseudorandom sequences of \(k\) symbols with length \(pq\)
Pseudo-random numbers; Monte Carlo methods (11K45) Exponential sums (11T23) Other character sums and Gauss sums (11T24)
Cites Work
- 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
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Equations over finite fields. An elementary approach
- Measures of pseudorandomness for binary sequences constructed using finite fields
- On pseudorandom binary lattices
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- On finite pseudorandom sequences of \(k\) symbols.
- Title not available (Why is that?)
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
- On finite pseudorandom lattices of \(k\) symbols
- On finite pseudorandom sequences of \(k\) symbols
- Distribution of digital explicit inversive pseudorandom numbers and their binary threshold sequence
- Title not available (Why is that?)
Cited In (7)
- Galois Rings and Pseudo-random Sequences
- On finite pseudorandom sequences of \(k\) symbols
- Large family of pseudorandom sequences of \(k\) symbols constructed by using multiplicative character
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite pseudorandom lattices of \(k\) symbols
This page was built for publication: On pseudorandom sequences of \(k\) symbols constructed using finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744022)