{"id":"W2121484689","doi":"10.1109/tcomm.2013.13.120317","title":"Grobner Bases for Lattices and an Algebraic Decoding Algorithm","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Gröbner basis; Decoding methods; Algebraic number; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Algebra over a field; Mathematics; Theoretical computer science; Block code; Computation; Concatenated error correction code; Pure 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000206054,0.0001145375,0.000104362,0.0001773946,0.0008730195,0.0002493289,0.001071275,0.00004712784,0.00004766772],"category_scores_gemma":[0.000004888913,0.000112943,0.00007685994,0.0003001167,0.0001300696,0.0009597369,0.00001061759,0.0001490139,0.00002357163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001209792,"about_ca_system_score_gemma":0.00001978313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006007388,"about_ca_topic_score_gemma":0.00008520524,"domain_scores_codex":[0.9992205,0.000126704,0.0001675073,0.0002316971,0.00007970347,0.0001739188],"domain_scores_gemma":[0.9976106,0.0007115682,0.00004859242,0.001431946,0.00009096641,0.0001063404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003590644,0.0003906699,0.00001454954,0.00001012458,0.00005004092,1.45672e-7,0.0009061811,0.0001280711,0.0007892124,0.09726378,0.0002406577,0.900203],"study_design_scores_gemma":[0.0008721221,0.0005302961,0.000517591,0.00007346916,0.00008981357,0.00002371369,0.0004620237,0.8250533,0.00466094,0.1517289,0.01533755,0.000650367],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003922209,0.0001188802,0.992435,0.002389401,0.0001429406,0.000307232,0.00001984087,0.0002183295,0.0004461023],"genre_scores_gemma":[0.6775977,0.000146191,0.3213898,0.000412712,0.00001473155,0.0003385686,0.000004280098,0.00000991497,0.00008606208],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8995526,"threshold_uncertainty_score":0.6714649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04023690450236831,"score_gpt":0.2959592228082651,"score_spread":0.2557223183058968,"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."}}