On the public citation graph
The autocorrelation of m-sequences over nonprime finite fields
0 signed · 17 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.1109/proc.1976.10411openalex-snapshot
Pseudo-random sequences and arrays
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.4500080106openalex-snapshot
Frequency hopping sequences with small cross‐correlation
inferred← citeshttps://doi.org/10.1016/j.bspc.2025.107894openalex-snapshot
Enhancing user experience in c-VEP-based BCI: Effects of visual stimulus opacity on performance and visual fatigue
inferred← citeshttps://doi.org/10.1016/j.ins.2008.01.015openalex-snapshot
On the linear complexity of some new q-ary sequences
inferred← citeshttps://doi.org/10.1109/18.108256openalex-snapshot
Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
inferred← citeshttps://doi.org/10.1109/49.56388openalex-snapshot
Maximal length sequences for frequency hopping
inferred← citeshttps://doi.org/10.1109/ccece.1993.332307openalex-snapshot
Cycle-set structure and correlation properties of families of multiple-valued sequences derived from non-primitive irreducible polynomials
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218492openalex-snapshot
Bridging link power asymmetry in mobile whitespace networks
inferred← citeshttps://doi.org/10.1109/secon.1989.132519openalex-snapshot
Evaluation of code division multiple access systems
inferred← citeshttps://doi.org/10.1109/secon.1989.132520openalex-snapshot
Frequency hopping m-sequences
inferred← citeshttps://doi.org/10.1109/ssst.1989.72439openalex-snapshot
Maximal-length pseudorandom number generator
inferred← citeshttps://doi.org/10.1109/ssst.1991.138503openalex-snapshot
Implementation consideration of code division multiple access sequences
inferred← citeshttps://doi.org/10.1109/tencon.1990.152602openalex-snapshot
Generalized m-sequences and their crosscorrelation properties
inferred← citeshttps://doi.org/10.1109/tit.2012.2204541openalex-snapshot
The Triple Autocorrelation of an ${m}$-Sequence is a Lempel Costas Array
inferred← citeshttps://doi.org/10.1177/003754979105700405openalex-snapshot
Decimal pseudo-random number generator
inferred← citeshttps://doi.org/10.5958/j.1945-919x.4.1a.003openalex-snapshot
Study on Cyclic Cross-Correlation Behaviour of Maximal Length Pseudo-Random Binary Sequences
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.