On pseudorandom binary sequences constructed by using finite fields

DOI10.1007/S10998-015-0104-1zbMath1363.11077OpenAlexW2291672652MaRDI QIDQ313474

Richárd Sebők

Publication date: 9 September 2016

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-015-0104-1

zbMATH Keywords

correlationfinite fieldsbinary sequencespseudorandomnesswell-distributions

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on certain modular constructions of pseudorandom binary sequences with composite moduli
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
• Measures of pseudorandomness for binary sequences constructed using finite fields
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• On the measures of pseudorandomness of binary sequences.
• Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\)
• Linear complexity profile of binary sequences with small correlation measure
• Modular constructions of pseudorandom binary sequences with composite moduli
• 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
• Measures of pseudorandomness for finite sequences: typical values
• Construction of large families of pseudorandom binary sequences
• Some estimates for character sums and applications

This page was built for publication: On pseudorandom binary sequences constructed by using finite fields