{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.003561747,0.001149555,0.001969526,0.0007481251,0.0003511187,0.001008623,0.005558607,0.0012987,0.00009376085],"category_scores_gemma":[0.0006513619,0.001260403,0.001249368,0.001664249,0.0002103588,0.0004999298,0.004666018,0.002302395,0.00001276834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004818982,"about_ca_system_score_gemma":0.001201905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003469917,"about_ca_topic_score_gemma":0.0003815137,"domain_scores_codex":[0.9916549,0.0007568998,0.001662527,0.002957025,0.001356627,0.001612009],"domain_scores_gemma":[0.9918178,0.001284395,0.0009122847,0.004269707,0.001304497,0.0004112585],"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.0002518338,0.002013272,0.002445226,0.003446457,0.001367639,0.0002032506,0.007981326,0.0119974,0.005910509,0.003176324,0.04804976,0.913157],"study_design_scores_gemma":[0.001793355,0.000360443,0.0005273719,0.003477312,0.0003689279,0.0001696948,0.00272318,0.9212466,0.05015772,0.01441126,0.001275105,0.003488976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0115322,0.001668322,0.9734557,0.0005992262,0.003144171,0.002055012,0.0001002036,0.000878663,0.00656647],"genre_scores_gemma":[0.3123589,0.0003255079,0.6851173,0.0001704163,0.0005741648,0.0006489079,0.0001784883,0.0001478921,0.0004783703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.909668,"threshold_uncertainty_score":0.9999993,"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."}}