{"id":"W4214518471","doi":"10.1109/access.2022.3155457","title":"CRC-Based Correction of Multiple Errors Using an Optimized Lookup Table","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université Polytechnique Hauts-de-France","keywords":"Notation; Lookup table; Speedup; Table (database); Error detection and correction; Arithmetic; Computer science; Mathematics; Algorithm; Discrete mathematics; Parallel computing","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000443174,0.00009519062,0.0001468201,0.0002145473,0.0003524159,0.0001102882,0.001164222,0.00002447329,0.0001024454],"category_scores_gemma":[0.00002116915,0.0001033172,0.00007514779,0.0009745508,0.00003962003,0.0007656426,0.0002016556,0.000130969,9.38604e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003642868,"about_ca_system_score_gemma":0.00008073694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003077229,"about_ca_topic_score_gemma":0.00001584021,"domain_scores_codex":[0.9989051,0.0002034646,0.0001811139,0.0002845427,0.0002411898,0.0001845814],"domain_scores_gemma":[0.9991413,0.0001187349,0.000150109,0.0004735889,0.00006199414,0.00005425574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001358497,0.0003009792,0.002763093,0.0000119507,0.00001463572,0.000006626834,0.0003287428,0.9781194,0.01221357,0.0004677622,0.0002806676,0.005356687],"study_design_scores_gemma":[0.0006726722,0.0001173569,0.0002179618,0.000009231192,0.000010193,0.000004802238,0.00005651962,0.9497018,0.0477125,0.0008956956,0.0004538561,0.0001473679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4936682,0.00001490969,0.5043381,0.00001589467,0.001588229,0.00009166153,0.000003854322,0.00009656161,0.000182535],"genre_scores_gemma":[0.9886765,5.469081e-7,0.01106861,0.0001617075,0.00003176209,0.00002229299,0.000003199574,0.000008996882,0.00002635754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4950083,"threshold_uncertainty_score":0.4213154,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05214330034223808,"score_gpt":0.3008951602924574,"score_spread":0.2487518599502194,"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."}}