MétaCan
Menu
Back to cohort
Record W2120095615 · doi:10.1109/isit.2004.1365219

Bounds on the minimum distances of a class of q-ary images of q/sup m/-ary irreducible cyclic codes

2004· article· en· W2120095615 on OpenAlexaff
Isaac Woungang, Alireza Sadeghian, W.W. Melek

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsCombinatoricsCode wordFinite fieldUpper and lower boundsCharacterization (materials science)MathematicsDiscrete mathematicsCode (set theory)PhysicsDecoding methodsAlgorithmMathematical analysisComputer science

Abstract

fetched live from OpenAlex

Let V=(n, k:) be an irreducible cyclic code over F/sub q//sup m/, the finite field of q/sup m/ elements. Let /spl alpha/_ be a basis of F/sub q//sup m/ over F/sub q/. Under the simplifying assumption (n,q)=1, it is shown that d/spl alpha/_(V), the q-ary image of V with respect to /spl alpha/, is decomposable into the direct sum of a fixed number of irreducible quasicyclic codes. This characterization allow us to obtain a lower bound on the minimum distance of d/spl alpha/_(V) by determining a lower bound on the number of not-null blocks in a typical codeword of d/spl alpha/_(V), for four specific subclasses of codes.

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

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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

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

Citations0
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicCoding theory and cryptographyFrench-language works237,207