MétaCan
Menu
Back to cohort
Record W2131868217 · doi:10.1109/nrc.2004.1316465

Efficient exhaustive search for optimal-peak-sidelobe binary codes

2004· article· en· W2131868217 on OpenAlex
Gregory E. Coxson, Jon Russo

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsLockheed Martin (Canada)
Fundersnot available
KeywordsPSLBinary numberCode (set theory)AutocorrelationBinary codeMathematicsComputer scienceAlgorithmCombinatoricsArithmeticStatisticsProgramming language

Abstract

fetched live from OpenAlex

An efficient exhaustive search routine is given which finds all binary codes of a given length having autocorrelation PSL under a given size. It was applied to two tasks, the first of which was to find all optimal-PSL binary codes of length 64. 1859 were found, of which 142 are balance-equivalent, i.e., they can be transformed to a balanced code by a combination of three PSL preservers. The second task was to find a PSL-4 binary code for each code length from 61 to 70, to establish 4 as the optimal PSL for those lengths.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.334
Threshold uncertainty score0.459

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.014
GPT teacher head0.236
Teacher spread0.222 · 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

Quick stats

Citations18
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicgraph theory and CDMA systemsFrench-language works237,207