MétaCan
Menu
Back to cohort
Record W2356387445

The Algorithm of High-Radix Transforms for Reed Solomon Codes Over Fermat Primes

2000· article· en· W2356387445 on OpenAlexaff
Hong Nie

Bibliographic record

VenueWuhan University Journal · 2000
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsCAE (Canada)
Fundersnot available
KeywordsRadix (gastropod)Fast Fourier transformSplit-radix FFT algorithmArithmeticRader's FFT algorithmAlgorithmDecoding methodsCode (set theory)Reed–Solomon error correctionMathematicsPrime-factor FFT algorithmCooley–Tukey FFT algorithmFermat numberComputer scienceFermat's Last TheoremDiscrete mathematicsLinear codeFourier transformBlock codeFourier analysisFractional Fourier transform
DOInot available

Abstract

fetched live from OpenAlex

Presents a new algorithm on transform decoding of Reed Solomon code, based on transform of Number Theory. It is show that a high radix FFT with generator γ =3 over GF( F n ) can be used for decoding of long RS codes of length 2 2 n . Such an RS decoder is considerably faster than a decoder using the usual radix 2 FFT. This technique applies most ideally to RS(255,223) code being considered currently for space and satellite communication applications.

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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.817
Threshold uncertainty score0.541

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.0010.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.005
GPT teacher head0.189
Teacher spread0.183 · 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 designOther design
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

Citations1
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueWuhan University JournalSame topicCoding theory and cryptographyFrench-language works237,207