MétaCan
Menu
Back to cohort
Record W2053024959 · doi:10.1109/tit.2004.842778

Polyphase Sequences With Low Autocorrelation

2005· article· en· W2053024959 on OpenAlexaff
Peter Borwein, Roger Ferguson

Bibliographic record

VenueIEEE Transactions on Information Theory · 2005
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsPolyphase systemMaxima and minimaAutocorrelationMathematicsSequence (biology)Autocorrelation matrixComplementary sequencesBase (topology)AlgorithmEnergy (signal processing)CombinatoricsDiscrete mathematicsMathematical analysisStatisticsPhysics

Abstract

fetched live from OpenAlex

Low autocorrelation for sequences is usually described in terms of low base energy, i.e., the sum of the sidelobe energies, or the maximum modulus of its autocorrelations, a Barker sequence occurring when this value is /spl les/ 1. We describe first an algorithm applying stochastic methods and calculus to the problem of finding polyphase sequences that are good local minima for the base energy. Starting from these, a second algorithm uses calculus to locate sequences that are local minima for the maximum modulus on autocorrelations. In our tabulation of smallest base energies found at various lengths, statistical evidence suggests we have good candidates for global minima or ground states up to length 45. We extend the list of known polyphase Barker sequences to length 63.

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.006
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: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.002
Science and technology studies0.0010.002
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0060.003

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.005
GPT teacher head0.207
Teacher spread0.202 · 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
GenreMethods

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

Citations86
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Information TheorySame topicCoding theory and cryptographyFrench-language works237,207