{"id":"W1491595969","doi":"10.1109/asap.1990.145465","title":"Array processing on finite polynomial rings","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Redundancy (engineering); Polynomial ring; Computer science; Testability; Computation; Overhead (engineering); Polynomial; Theoretical computer science; Computational complexity theory; Algorithm; Parallel computing; Mathematics","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.0002528647,0.0003292073,0.0003243681,0.0004702111,0.0004530458,0.001007447,0.0004954424,0.0003582769,0.006515125],"category_scores_gemma":[0.001105605,0.0001653679,0.0003157029,0.0006775561,0.0004776539,0.00149977,0.0006264008,0.000399528,0.002207431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004046149,"about_ca_system_score_gemma":0.0003650932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007647342,"about_ca_topic_score_gemma":0.001022525,"domain_scores_codex":[0.9997688,0.00004948784,0.00001976592,0.00004250066,0.00008519337,0.00003428351],"domain_scores_gemma":[0.9995776,0.0001907377,0.00003230356,0.0001051883,0.00008021121,0.00001406138],"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.0005153146,0.00006158766,0.0004427453,0.0003495973,0.00004263371,0.0004649024,0.0004287086,0.1579033,0.136068,0.2735719,0.009707791,0.4204434],"study_design_scores_gemma":[0.00006334596,0.0002232559,0.0002958475,0.00005489041,0.00002063507,0.0003753652,0.0001209114,0.7695927,0.09528609,0.1009654,0.03296331,0.00003830733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03430383,0.0005214699,0.9446101,0.0002242983,0.0001043078,0.00004385795,0.0001056025,0.001608428,0.01847813],"genre_scores_gemma":[0.4893559,0.001104273,0.4886022,0.0001703187,0.0002076073,0.00009727483,0.0003137567,0.0001671557,0.01998158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006515125,"threshold_uncertainty_score":0.02179521,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02148404115082803,"score_gpt":0.2148130405362929,"score_spread":0.1933289993854649,"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."}}