On the public citation graph
Generalized GMW Quadriphase Sequences Satisfying the Welch Bound with Equality
0 signed · 35 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/978-1-4684-4730-9_20openalex-snapshot
Shift-Register Synthesis (Modulo m)
inferredcites →https://doi.org/10.1007/bfb0019857openalex-snapshot
A quaternary cyclic code, and a family of quadriphase sequences with low correlation properties
inferredcites →https://doi.org/10.1007/s002000050101openalex-snapshot
Optimal and Suboptimal Quadriphase Sequences Derived from Maximal Length Sequences over Z _{{\bf 4}}
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1090/s0002-9947-1921-1501173-4openalex-snapshot
Polynomials and their residue systems
inferredcites →https://doi.org/10.1109/18.135649openalex-snapshot
4-phase sequences with near-optimum correlation properties
inferredcites →https://doi.org/10.1109/18.481790openalex-snapshot
Optimal biphase sequences with large linear complexity derived from sequences over Z/sub 4/
inferredcites →https://doi.org/10.1109/18.485726openalex-snapshot
Large families of quaternary sequences with low correlation
inferredcites →https://doi.org/10.1109/18.605584openalex-snapshot
Optimal phases for a family of quadriphase CDMA sequences
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
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-981-97-4876-1_12openalex-snapshot
Large Family of Quaternary Sequences with High Linear Complexity and Period $$p^nq^m$$
inferred← citeshttps://doi.org/10.1007/s00200-022-00559-2openalex-snapshot
Linear complexity of two classes of quaternary sequences based on sign alternation transformation
inferred← citeshttps://doi.org/10.1007/s11460-009-0038-6openalex-snapshot
GMW sequences over Galois rings and their linear complexities
inferred← citeshttps://doi.org/10.1007/s12095-016-0185-6openalex-snapshot
Linear complexity and trace representation of quaternary sequences over ℤ 4 $\mathbb {Z}_{4}$ based on generalized cyclotomic classes modulo pq
inferred← citeshttps://doi.org/10.1007/s12095-021-00534-7openalex-snapshot
The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods pn and 2pn
inferred← citeshttps://doi.org/10.1007/s12095-023-00649-zopenalex-snapshot
Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period p
inferred← citeshttps://doi.org/10.1016/j.dam.2026.09.026openalex-snapshot
Linear complexity and trace representation of Ding–Helleseth generalized cyclotomic quaternary sequences with period pq
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106494openalex-snapshot
The autocorrelation of a class of quaternary sequences of length pq with high complexity
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106595openalex-snapshot
Notes about the linear complexity of quaternary cyclotomic sequences of order four
inferred← citeshttps://doi.org/10.1016/j.laa.2007.04.015openalex-snapshot
The predictable degree property and row reducedness for systems over a finite ring
inferred← citeshttps://doi.org/10.1016/s1005-8885(14)60336-8openalex-snapshot
Linear complexity of quaternary sequences with odd period and low autocorrelation
inferred← citeshttps://doi.org/10.1080/23799927.2015.1130749openalex-snapshot
Trace representation of cyclotomic generator of orderr
inferred← citeshttps://doi.org/10.1109/itw54588.2022.9965923openalex-snapshot
The linear complexity of sequences with low autocorrelation from interleaved technique and period pq
inferred← citeshttps://doi.org/10.1109/jsac.2005.858877openalex-snapshot
Design of spreading codes for quasi-synchronous CDMA with intercell interference
inferred← citeshttps://doi.org/10.1109/tit.2005.850228openalex-snapshot
A New Family of Nonbinary Sequences With Three-Level Correlation Property and Large Linear Span
inferred← citeshttps://doi.org/10.1109/tit.2012.2201132openalex-snapshot
A New Family of $p$-Ary Sequences With Low Correlation Constructed From Decimated Sequences
inferred← citeshttps://doi.org/10.1155/2020/6538970openalex-snapshot
Linear Complexity of a New Class of Quaternary Generalized Cyclotomic Sequence with Period 2pm
inferred← citeshttps://doi.org/10.1587/transfun.2024eal2026openalex-snapshot
Trace Representation of Balanced Quaternary Generalized Cyclotomic Sequences of Period pn
inferred← citeshttps://doi.org/10.1587/transfun.e101.a.867openalex-snapshot
Linear Complexity of Quaternary Sequences over Z4 Based on Ding-Helleseth Generalized Cyclotomic Classes
inferred← citeshttps://doi.org/10.1587/transfun.e96.a.997openalex-snapshot
On the Linear Complexity of a Class of Quaternary Sequences with Low Autocorrelation
inferred← citeshttps://doi.org/10.3934/amc.2018031openalex-snapshot
On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation
inferred← citeshttps://doi.org/10.3934/amc.2025053openalex-snapshot
Estimate of 4-adic complexity of cyclotomic sequences of order eight with prime period
inferred← citeshttps://doi.org/10.48550/arxiv.1603.05086openalex-snapshot
Linear complexity of quaternary sequences over Z_4 derived from generalized cyclotomic classes modulo 2p
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.