On pseudorandom sequences of \(k\) symbols constructed using finite fields

DOI10.1007/S00200-014-0224-5zbMath1342.11068OpenAlexW2002915086MaRDI QIDQ744022

Zhixing Lin, Xiaoni Du

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

zbMATH Keywords

exponential sumsfinite fieldscharacter sumspseudorandom sequencessequences of \(k\) symbols

Mathematics Subject Classification ID

Exponential sums (11T23) Other character sums and Gauss sums (11T24) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
• Measures of pseudorandomness for binary sequences constructed using finite fields
• Equations over finite fields. An elementary approach
• On finite pseudorandom sequences of \(k\) symbols.
• On finite pseudorandom sequences of \(k\) symbols
• Distribution of Digital Explicit Inversive Pseudorandom Numbers and Their Binary Threshold Sequence
• On pseudorandom binary lattices
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• 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
• Construction of large families of pseudorandom binary sequences
• Some estimates for character sums and applications
• On finite pseudorandom lattices of \(k\) symbols

This page was built for publication: On pseudorandom sequences of \(k\) symbols constructed using finite fields