{"id":"W3186617254","doi":"10.1109/gcwkshps52748.2021.9682042","title":"A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes","year":2021,"lang":"en","type":"preprint","venue":"2021 IEEE Globecom Workshops (GC Wkshps)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Node (physics); Tree (set theory); Search tree; Metric (unit); List decoding; Algorithm; Sequential decoding; Computer science; Breadth-first search; Scheme (mathematics); Mathematics; Search algorithm; Theoretical computer science; Concatenated error correction code; Block code; Combinatorics","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.0003699877,0.0004960428,0.0004573286,0.0009395137,0.0004334166,0.0006171156,0.0006588415,0.0006754813,0.002762513],"category_scores_gemma":[0.0021291,0.0002228099,0.0004223812,0.001164268,0.0003435872,0.0008902581,0.0006290516,0.0007483641,0.001520055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005173856,"about_ca_system_score_gemma":0.001318792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001943738,"about_ca_topic_score_gemma":0.003103961,"domain_scores_codex":[0.9994397,0.0001402078,0.0000307762,0.00005016605,0.0002931494,0.00004612377],"domain_scores_gemma":[0.9992986,0.0003476987,0.00005734734,0.0000697801,0.0002050943,0.00002151046],"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.0002035772,0.00006365748,0.0005223237,0.0003551589,0.00006019238,0.000261901,0.0002207629,0.2364356,0.07601644,0.1085936,0.004796919,0.5724699],"study_design_scores_gemma":[0.00002121923,0.0001124266,0.0001233821,0.00002923602,0.00001617929,0.000330686,0.0000236119,0.953472,0.01657397,0.02211706,0.007156657,0.0000237071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002089998,0.0002106913,0.9961264,0.0000357036,0.00001456473,0.00002387932,0.00003190558,0.0002532345,0.001213576],"genre_scores_gemma":[0.1049099,0.0006289454,0.8910818,0.0000903124,0.00004505002,0.0001124443,0.0002448184,0.00009787195,0.002788845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002762513,"threshold_uncertainty_score":0.009241581,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0410918582760855,"score_gpt":0.3015719779900493,"score_spread":0.2604801197139638,"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."}}