On pseudorandom binary sequences constructed by using finite fields

DOI10.1007/S10998-015-0104-1zbMATH Open1363.11077OpenAlexW2291672652MaRDI QIDQ313474FDOQ313474

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

Recommendations

• Measures of pseudorandomness for binary sequences constructed using finite fields
• On the measures of pseudorandomness of binary sequences.
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• On pseudorandom sequences of \(k\) symbols constructed using finite fields
• A construction of pseudorandom binary sequences using rational functions

zbMATH Keywords

correlationbinary sequencesfinite fieldspseudorandomnesswell-distributions

Mathematics Subject Classification ID

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

Cites Work

• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Title not available (Why is that?)
• 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
• Measures of pseudorandomness for finite sequences: typical values
• Title not available (Why is that?)
• 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 the correlation of subsequences
• Title not available (Why is that?)
• On pseudorandom binary lattices
• On the correlation of pseudorandom binary sequences with composite moduli
• Title not available (Why is that?)
• A note on certain modular constructions of pseudorandom binary sequences with composite moduli
• Title not available (Why is that?)
• Title not available (Why is that?)
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II

Cited In (13)

• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• On linear recursion and pseudorandomness
• A note on certain modular constructions of pseudorandom binary sequences with composite moduli
• Constructing new covering arrays from LFSR sequences over finite fields
• Measures of pseudorandomness for binary sequences constructed using finite fields
• Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
• Title not available (Why is that?)
• A family of pseudorandom binary sequences constructed by the multiplicative inverse
• Title not available (Why is that?)
• On finite pseudorandom binary sequences IV: The Liouville function, II
• Finite binary sequences constructed by explicit inversive methods
• Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
• Modular constructions of pseudorandom binary sequences with composite moduli

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313474)