MétaCan
Menu
Back to cohort
Record W2139506438 · doi:10.1587/transfun.e93.a.2266

Binary Sequence Pairs with Two-Level Correlation and Cyclic Difference Pairs

2010· article· en· W2139506438 on OpenAlexfundno aff
Seok-Yong Jin, Hong‐Yeop Song

Bibliographic record

VenueIEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2010
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsnot available
FundersUniversity of Waterloo
KeywordsMathematicsIdeal (ethics)Sequence (biology)ConjectureCombinatoricsPseudorandom binary sequenceCirculant matrixHadamard matrixBinary numberHadamard transformDiscrete mathematicsMathematical analysisArithmetic

Abstract

fetched live from OpenAlex

We investigate binary sequence pairs with two-level correlation in terms of their corresponding cyclic difference pairs (CDPs). We define multipliers of a cyclic difference pair and present an existence theorem for multipliers, which could be applied to check the existence/nonexistence of certain hypothetical cyclic difference pairs. Then, we focus on the ideal case where all the out-of-phase correlation coefficients are zero. It is known that such an ideal binary sequence pair exists for length v= 4u for every u ≥ 1. Using the techniques developed here on the theory of multipliers of a CDP and some exhaustive search, we are able to determine that, for lengths v ≤ 30, (1) there does not exist “any other” ideal binary sequence pair and (2) every example in this range is equivalent to the one of length v = 4u above. We conjecture that if there is a binary sequence pair with an ideal two-level correlation then its in-phase correlation must be 4. This implies so called the circulant Hadamard matrix conjecture.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.027
GPT teacher head0.247
Teacher spread0.220 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations14
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueIEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesSame topicgraph theory and CDMA systemsFrench-language works237,207