On the public citation graph

The Merit Factor Problem for Binary Sequences

0 signed · 46 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11423461_2openalex-snapshot
A Survey of the Merit Factor Problem for Binary Sequences
inferredcites →https://doi.org/10.1007/978-1-4613-1983-2openalex-snapshot
Finite Fields for Computer Scientists and Engineers
inferredcites →https://doi.org/10.1007/978-94-011-4459-9_9openalex-snapshot
The Merit Factor of Binary Sequences
inferredcites →https://doi.org/10.1007/bfb0061260openalex-snapshot
Cyclic Difference Sets
inferredcites →https://doi.org/10.1016/s0166-218x(99)00085-2openalex-snapshot
Perfect and almost perfect sequences
inferredcites →https://doi.org/10.1049/el:19750391openalex-snapshot
Binary sequences up to length 40 with best possible autocorrelation function
inferredcites →https://doi.org/10.1051/jphys:01987004804055900openalex-snapshot
Low autocorrelation binary sequences : statistical mechanics and configuration space analysis
inferredcites →https://doi.org/10.1080/02331939208843771openalex-snapshot
Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies
inferredcites →https://doi.org/10.1088/0305-4470/29/18/005openalex-snapshot
Exhaustive search for low-autocorrelation binary sequences
inferredcites →https://doi.org/10.1088/0305-4470/29/3/004openalex-snapshot
A statistical mechanics analysis of the set covering problem
inferredcites →https://doi.org/10.1090/s0002-9939-1959-0116184-5openalex-snapshot
Some Theorems on Fourier Coefficients
inferredcites →https://doi.org/10.1109/18.2620openalex-snapshot
Determination of the merit factor of Legendre sequences
inferredcites →https://doi.org/10.1109/18.79917openalex-snapshot
The merit factor of binary sequences related to difference sets
inferredcites →https://doi.org/10.1109/7.192096openalex-snapshot
Sequences and arrays with perfect periodic correlation
inferredcites →https://doi.org/10.1109/tit.1977.1055653openalex-snapshot
Sieves for low autocorrelation binary sequences
inferredcites →https://doi.org/10.1109/tit.1983.1056744openalex-snapshot
The merit factor of Legendre sequences (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057071openalex-snapshot
Aperiodic correlations and the merit factor of a class of binary sequences (Corresp.)
inferredcites →https://doi.org/10.1109/tit.2004.838341openalex-snapshot
Binary Sequences With Merit Factor Greater Than $6.34$
inferredcites →https://doi.org/10.1109/tit.2004.838343openalex-snapshot
Binary Sequences With Merit Factor $≫ 6.3$
inferredcites →https://doi.org/10.1112/jlms/s1-41.1.367openalex-snapshot
On Polynomials ∑±nzm,∑eαminzm,z=e0i
inferredcites →https://doi.org/10.2307/2324003openalex-snapshot
The L 4 Norm of a Polynomial with Coefficients ± 1

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10623-015-0154-7openalex-snapshot
Sequences with small correlation
inferred← citeshttps://doi.org/10.1016/j.acha.2018.07.003openalex-snapshot
Crosscorrelation of Rudin–Shapiro-like polynomials
inferred← citeshttps://doi.org/10.1016/j.aim.2013.03.015openalex-snapshot
Littlewood polynomials with small L4 norm
inferred← citeshttps://doi.org/10.1016/j.jcta.2013.01.010openalex-snapshot
Advances in the merit factor problem for binary sequences
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.08.006openalex-snapshot
Merit factors of polynomials derived from difference sets
inferred← citeshttps://doi.org/10.1016/j.sigpro.2023.108929openalex-snapshot
Effective and efficient gradient based methods for low-bit discrete-phase sequence designs
inferred← citeshttps://doi.org/10.1088/1751-8113/49/16/165001openalex-snapshot
Low autocorrelation binary sequences
inferred← citeshttps://doi.org/10.1109/icassp.2008.4518443openalex-snapshot
Transmit codes and receive filters for pulse compression radar systems
inferred← citeshttps://doi.org/10.1109/icoa.2018.8370526openalex-snapshot
Local search algorithm for low autocorrelation binary sequences
inferred← citeshttps://doi.org/10.1109/itwitwn.2007.4318030openalex-snapshot
On Sequences with Good Correlation Properties: A New Perspective
inferred← citeshttps://doi.org/10.1109/lsp.2023.3344069openalex-snapshot
On Binary Sequence Design via PSL Minimization
inferred← citeshttps://doi.org/10.1109/msp.2008.929231openalex-snapshot
Transmit codes and receive filters for radar
inferred← citeshttps://doi.org/10.1109/msp.2010.936724openalex-snapshot
Probing Waveform Synthesis and Receiver Filter Design
inferred← citeshttps://doi.org/10.1109/oceans.2010.5663834openalex-snapshot
On probing waveforms and adaptive receivers for active sonar
inferred← citeshttps://doi.org/10.1109/tit.2008.926436openalex-snapshot
On Binary Probing Signals and Instrumental Variables Receivers for Radar
inferred← citeshttps://doi.org/10.1109/tnnls.2019.2942951openalex-snapshot
AlphaSeq: Sequence Discovery With Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/tnnls.2021.3126944openalex-snapshot
HpGAN: Sequence Search With Generative Adversarial Networks
inferred← citeshttps://doi.org/10.1109/tsp.2009.2012562openalex-snapshot
New Algorithms for Designing Unimodular Sequences With Good Correlation Properties
inferred← citeshttps://doi.org/10.1109/tsp.2019.2954525openalex-snapshot
Efficient Design of Binary Sequences With Low Autocorrelation Sidelobes
inferred← citeshttps://doi.org/10.1121/1.3575604openalex-snapshot
Probing waveforms and adaptive receivers for active sonar
inferred← citeshttps://doi.org/10.1177/1094342019868515openalex-snapshot
A study of the loops control for reconfigurable computing with OpenCL in the LABS local search problem
inferred← citeshttps://doi.org/10.2140/pjm.2013.263.373openalex-snapshot
AsymptoticL4norm of polynomials derived from characters
inferred← citeshttps://doi.org/10.2478/udt-2020-0003openalex-snapshot
A Class of Littlewood Polynomials that are Not L α -Flat
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0260openalex-snapshot
Littlewood Polynomials with Small $L^4$ Norm
inferred← citeshttps://doi.org/10.48550/arxiv.2012.05645openalex-snapshot
HpGAN: Sequence Search with Generative Adversarial Networks
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.