On the public citation graph
Optimal characteristic polynomials for digital multistep pseudorandom numbers
0 signed · 28 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01294651openalex-snapshot
Point sets and sequences with small discrepancy
inferredcites →https://doi.org/10.1007/bf01318069openalex-snapshot
Rational functions with partial quotients of small degree in their continued fraction expansion
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1073/pnas.61.1.25openalex-snapshot
RANDOM NUMBERS FALL MAINLY IN THE PLANES
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
inferredcites →https://doi.org/10.1090/conm/022openalex-snapshot
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0184406-1openalex-snapshot
Random Numbers Generated by Linear Recurrence Modulo Two
inferredcites →https://doi.org/10.1109/tit.1973.1055002openalex-snapshot
Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972)
inferredcites →https://doi.org/10.1137/0905057openalex-snapshot
The Performance of k -Step Pseudorandom Number Generators under the Uniformity Test
inferredcites →https://doi.org/10.18926/mjou/33556openalex-snapshot
The serial test for digital k-step pseudorandom numbers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-2552-2_4openalex-snapshot
Tables of (T, M, S)-Net and (T, 5)-Sequence Parameters
inferred← citeshttps://doi.org/10.1007/978-1-4757-2553-7_7openalex-snapshot
Generating Pseudorandom Numbers
inferred← citeshttps://doi.org/10.1007/978-3-0348-6398-8_15openalex-snapshot
Quasi-Monte Carlo Methods for Multidimensional Numerical Integration
inferred← citeshttps://doi.org/10.1007/bf02204856openalex-snapshot
Recent trends in random number and random vector generation
inferred← citeshttps://doi.org/10.1007/bfb0096988openalex-snapshot
Pseudorandom numbers generated from shift register sequences
inferred← citeshttps://doi.org/10.1090/s0025-5718-1990-1011436-4openalex-snapshot
Figures of Merit for Digital Multistep Pseudorandom Numbers
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1155576-0openalex-snapshot
On the Use of Reducible Polynomials as Random Number Generators
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1160278-0openalex-snapshot
Calculation of Fibonacci Polynomials for GFSR Sequences with Low Discrepancies
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1176708-4openalex-snapshot
On the distribution of 𝑘-dimensional vectors for simple and combined Tausworthe sequences
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1182244-1openalex-snapshot
Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration
inferred← citeshttps://doi.org/10.1145/116890.116892openalex-snapshot
Efficient and portable combined Tausworthe random number generators
inferred← citeshttps://doi.org/10.1145/167293.167397openalex-snapshot
Fast generation of low discrepancy points based on Fibonacci polynomials
inferred← citeshttps://doi.org/10.1145/76738.76744openalex-snapshot
A tutorial on uniform variate generation
inferred← citeshttps://doi.org/10.21136/cmj.1992.128322openalex-snapshot
Low-discrepancy point sets obtained by digital constructions over finite fields
inferred← citeshttps://doi.org/10.5023/jappstat.21.37openalex-snapshot
A Fast Quasi-Monte Carlo Method Based on the Polynomial Arithmetic over a Galois Field
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.