{"id":"W2356387445","doi":"","title":"The Algorithm of High-Radix Transforms for Reed Solomon Codes Over Fermat Primes","year":2000,"lang":"en","type":"article","venue":"Wuhan University Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Radix (gastropod); Fast Fourier transform; Split-radix FFT algorithm; Arithmetic; Rader's FFT algorithm; Algorithm; Decoding methods; Code (set theory); Reed–Solomon error correction; Mathematics; Prime-factor FFT algorithm; Cooley–Tukey FFT algorithm; Fermat number; Computer science; Fermat's Last Theorem; Discrete mathematics; Linear code; Fourier transform; Block code; Fourier analysis; Fractional Fourier transform","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006166679,0.0007147429,0.0004518224,0.001089824,0.0006084838,0.001035375,0.0007376616,0.00081336,0.00389908],"category_scores_gemma":[0.002162273,0.0002977895,0.0006153589,0.0008519199,0.001223456,0.001778916,0.0009022803,0.001619882,0.003749223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005355789,"about_ca_system_score_gemma":0.0009286418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004036785,"about_ca_topic_score_gemma":0.0004473845,"domain_scores_codex":[0.9994116,0.0001193029,0.00004806445,0.00008566871,0.000272955,0.00006252105],"domain_scores_gemma":[0.9994672,0.0002213465,0.00004946579,0.0001175541,0.0001263639,0.00001807702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002969808,0.00006287585,0.0005195266,0.0002706397,0.000044055,0.0003612067,0.0004770453,0.01831984,0.0488042,0.3381905,0.01026904,0.5823841],"study_design_scores_gemma":[0.0002308929,0.0007210088,0.0008681683,0.0002035778,0.00007674674,0.003138904,0.0001994988,0.2366688,0.2016435,0.4016224,0.154411,0.0002155328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008151929,0.0003233471,0.98208,0.0002329822,0.0001843614,0.0001038286,0.00007756142,0.001161397,0.007684593],"genre_scores_gemma":[0.1009998,0.0005855611,0.8857674,0.0002245896,0.0001965442,0.0002014063,0.0004727571,0.0004266545,0.01112532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00389908,"threshold_uncertainty_score":0.0130437,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005408295875339046,"score_gpt":0.188680578161241,"score_spread":0.1832722822859019,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}