{"id":"W3161348053","doi":"10.1109/icassp39728.2021.9414311","title":"Towards Practical Near-Maximum-Likelihood Decoding of Error-Correcting Codes: An Overview","year":2021,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Sequential decoding; Algorithm; Code (set theory); Berlekamp–Welch algorithm; Limit (mathematics); Field (mathematics); Implementation; Block (permutation group theory); Noisy-channel coding theorem; Theoretical computer science; Computer engineering; Concatenated error correction code; Block code; Mathematics; Programming language","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.001262444,0.0002468397,0.0004312828,0.00009880183,0.000196829,0.0003150911,0.0008469787,0.0001411103,0.0001384371],"category_scores_gemma":[0.001386321,0.0002441797,0.0001621847,0.0009967071,0.00006060877,0.001223961,0.0007662987,0.0004129539,0.00002603405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001006354,"about_ca_system_score_gemma":0.0007796526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00035973,"about_ca_topic_score_gemma":0.0004249155,"domain_scores_codex":[0.9972774,0.0003352544,0.0005732342,0.0007468715,0.0005515477,0.0005157046],"domain_scores_gemma":[0.9973541,0.000452235,0.0002622424,0.001222516,0.0005039415,0.0002049271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001871453,0.0007937762,0.005693261,0.0002278555,0.00008527222,0.0003405364,0.005296906,0.00005247089,0.01072802,0.07854188,0.002194665,0.8960267],"study_design_scores_gemma":[0.0007338198,0.000817159,0.00264717,0.0007150091,0.00008462501,0.002193146,0.002609835,0.373681,0.5556422,0.05470756,0.004699892,0.001468594],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05815908,0.0004524493,0.9238436,0.001403784,0.0008953265,0.0001762893,0.000001621788,0.001331064,0.01373675],"genre_scores_gemma":[0.4189909,0.0000455462,0.580359,0.0004727063,0.00004323795,0.000009633006,0.000002324663,0.00002011298,0.00005653935],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8945581,"threshold_uncertainty_score":0.995736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1108923124351034,"score_gpt":0.3919479717937379,"score_spread":0.2810556593586345,"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."}}