MétaCan
Menu
Back to cohort
Record W2115938507 · doi:10.1109/tit.2007.915972

Guided Scrambling Polynomials for Periodic Quotient Relationship Patterns

2008· article· en· W2115938507 on OpenAlexaff
Yan Xin, I.J. Fair

Bibliographic record

VenueIEEE Transactions on Information Theory · 2008
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsScramblingQuotientEncoderCode wordMathematicsDiscrete mathematicsCoding (social sciences)Unit intervalAlgorithmComputer scienceArithmeticCombinatoricsDecoding methodsStatistics

Abstract

fetched live from OpenAlex

Guided scrambling (GS) is a constrained coding technique that can be used in digital communication systems to control the characteristics of the encoded sequence. In each encoding interval, a GS encoder constructs a quotient selection set with a number of codeword candidates and selects the "best" candidate to represent the source word. Relationships between candidates in the quotient selection set impact the quality of the transmitted sequence. In particular, in some applications it is desired that the quotient relationship patterns (QRPs) be periodic, and in other applications, periodic QRPs are to be avoided. QRPs are determined by the scrambling polynomial. In this correspondence, we derive the general form for scrambling polynomials that generate all periodic quotient relationship patterns.

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 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.001
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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.941
Threshold uncertainty score0.780

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.000
Scholarly communication0.0000.002
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.040
GPT teacher head0.256
Teacher spread0.216 · 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 teacher head, 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

Citations3
Published2008
Admission routes1
Has abstractyes

Explore more

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