On the public citation graph
Maximal length sequences for frequency hopping
0 signed · 47 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-4613-1983-2openalex-snapshot
Finite Fields for Computer Scientists and Engineers
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1109/7.7190openalex-snapshot
The autocorrelation of m-sequences over nonprime finite fields
inferredcites →https://doi.org/10.1109/proc.1985.13291openalex-snapshot
Spread-spectrum communications
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.1002/dac.4510050107openalex-snapshot
Generation of m‐sequences over GF(q2) from m‐sequences over GF(q)
inferred← citeshttps://doi.org/10.1007/s10623-010-9480-yopenalex-snapshot
The linear span of the frequency hopping sequences in optimal sets
inferred← citeshttps://doi.org/10.1007/s11432-006-0208-6openalex-snapshot
Lower bounds on the periodic Hamming correlations of frequency hopping sequences with low hit zone
inferred← citeshttps://doi.org/10.1007/s12095-022-00569-4openalex-snapshot
Optimal frequency-hopping sequences based on the decimated m-sequences
inferred← citeshttps://doi.org/10.1016/j.dam.2018.04.005openalex-snapshot
Optimal FHSs and DSSs via near zero-difference balanced functions
inferred← citeshttps://doi.org/10.1049/iet-com.2014.1121openalex-snapshot
Zero intersymbol interference multiuser system: a new architecture utilising m ‐sequence cyclic property
inferred← citeshttps://doi.org/10.1051/ita/2012007openalex-snapshot
Linear spans of optimal sets of frequency hopping sequences
inferred← citeshttps://doi.org/10.1109/18.681324openalex-snapshot
Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
inferred← citeshttps://doi.org/10.1109/68.76880openalex-snapshot
Fiber optic frequency hopping multiple access communication system
inferred← citeshttps://doi.org/10.1109/icc52391.2025.11162102openalex-snapshot
Dynamic Spectrum Control Transmission Scheme Based on Chaotic Mapping Switching for Satellite Covert Communication
inferred← citeshttps://doi.org/10.1109/incos.2011.112openalex-snapshot
Linear Complexities of the Frequency Hopping Sequences in Two Optimal Sets
inferred← citeshttps://doi.org/10.1109/iwsda.2009.5346447openalex-snapshot
A new construction of optimal frequency hopping sequence sets
inferred← citeshttps://doi.org/10.1109/iwsda.2013.6849088openalex-snapshot
Optimal frequency hopping sequence sets from MDS codes
inferred← citeshttps://doi.org/10.1109/pdcat.2003.1236444openalex-snapshot
A class of frequency hopping sequences with no hit zone
inferred← citeshttps://doi.org/10.1109/tcomm.2020.3037550openalex-snapshot
Sporadic Ultra-Time-Critical Crowd Messaging in V2X
inferred← citeshttps://doi.org/10.1109/tit.2004.833362openalex-snapshot
Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
inferred← citeshttps://doi.org/10.1109/tit.2004.834783openalex-snapshot
Optimal Frequency Hopping Sequences: A Combinatorial Approach
inferred← citeshttps://doi.org/10.1109/tit.2004.834792openalex-snapshot
Frequency Hopping Sequences With Optimal Partial Autocorrelation Properties
inferred← citeshttps://doi.org/10.1109/tit.2008.2009856openalex-snapshot
Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
inferred← citeshttps://doi.org/10.1109/tit.2008.926328openalex-snapshot
Delay Optimal Transmission Policy in a Wireless Multiaccess Channel
inferred← citeshttps://doi.org/10.1109/tit.2008.926410openalex-snapshot
Sets of Optimal Frequency-Hopping Sequences
inferred← citeshttps://doi.org/10.1109/tit.2009.2021366openalex-snapshot
Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
inferred← citeshttps://doi.org/10.1109/tit.2009.2025569openalex-snapshot
On the Sidel'nikov Sequences as Frequency-Hopping Sequences
inferred← citeshttps://doi.org/10.1109/tit.2010.2040874openalex-snapshot
Optimal Sets of Frequency Hopping Sequences With Large Linear Spans
inferred← citeshttps://doi.org/10.1109/tit.2010.2048504openalex-snapshot
Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2137290openalex-snapshot
New Constructions for Optimal Sets of Frequency-Hopping Sequences
inferred← citeshttps://doi.org/10.1109/tit.2011.2162571openalex-snapshot
New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions
inferred← citeshttps://doi.org/10.1109/tit.2012.2195771openalex-snapshot
A Class of Optimal Frequency Hopping Sequences with New Parameters
inferred← citeshttps://doi.org/10.1109/tit.2012.2234501openalex-snapshot
High-Rate Self-Synchronizing Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2237754openalex-snapshot
Optimal Frequency Hopping Sequences of Odd Length
inferred← citeshttps://doi.org/10.1109/tit.2014.2332996openalex-snapshot
A New Construction of Frequency-Hopping Sequences With Optimal Partial Hamming Correlation
inferred← citeshttps://doi.org/10.1109/tit.2015.2512859openalex-snapshot
Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes
inferred← citeshttps://doi.org/10.1109/tit.2016.2556710openalex-snapshot
A Combinatorial Construction for Strictly Optimal Frequency-Hopping Sequences
inferred← citeshttps://doi.org/10.1109/wcnc.2004.1311822openalex-snapshot
Optimal unequal channel protection of multiple-description product codes for multimedia communications over fast fading channels
inferred← citeshttps://doi.org/10.1142/s0129054113500196openalex-snapshot
NEW OPTIMAL FREQUENCY HOPPING SEQUENCE SETS FROM BALANCED NESTED DIFFERENCE PACKINGS OF PARTITION-TYPE
inferred← citeshttps://doi.org/10.1142/s0129054125500017openalex-snapshot
New Families of Frequency-Hopping Sequence Sets with Optimal Hamming Correlation
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1569openalex-snapshot
Lower Bounds on the Aperiodic Hamming Correlations of Frequency Hopping Sequences with Low Hit Zone
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2497551/v1openalex-snapshot
A class of optimal frequency hopping sequences based on the decimated m-sequences
inferred← citeshttps://doi.org/10.3390/e26110935openalex-snapshot
A Construction of Optimal One-Coincidence Frequency-Hopping Sequences via Generalized Cyclotomy
inferred← citeshttps://doi.org/10.3934/amc.2013.7.91openalex-snapshot
New constructions of optimal frequency hopping sequences with new parameters
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.