MétaCan
Menu
Back to cohort
Record W2972280902 · doi:10.1109/tit.2019.2939113

On Inverses of Permutation Polynomials of Small Degree Over Finite Fields

2019· article· en· W2972280902 on OpenAlexafffund

Bibliographic record

VenueIEEE Transactions on Information Theory · 2019
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of CanadaDongguan University of TechnologyGuangdong Polytechnic of Science and TechnologyChina Postdoctoral Science FoundationNatural Science Foundation of Guangxi ProvinceNational Natural Science Foundation of ChinaPeng Cheng LaboratoryNational Science Foundation
KeywordsFinite fieldDegree (music)Permutation (music)InverseCoding theoryBinomial (polynomial)Class (philosophy)Discrete orthogonal polynomialsGeneralized permutation matrix

Abstract

fetched live from OpenAlex

Permutation polynomials (PPs) and their inverses have applications in cryptography, coding theory and combinatorial design theory. In this paper, we make a brief summary of the inverses of PPs of finite fields, and give the inverses of all PPs of degree ≤ 6 over finite fields Fq for all q and the inverses of all PPs of degree 7 over F2(n). The explicit inverse of a class of fifth degree PPs is the main result, which is obtained by using Lucas' theorem, some congruences of binomial coefficients, and a known formula for the inverses of PPs of finite fields.

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.005
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.003
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0000.002
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0030.001

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.016
GPT teacher head0.218
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
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

Citations23
Published2019
Admission routes2
Has abstractyes

Explore more

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