{"id":"W2750544224","doi":"10.1109/lcomm.2017.2740305","title":"Fast Successive-Cancellation Decoding of Polar Codes: Identification and Decoding of New Nodes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Computer science; Sequential decoding; Berlekamp–Welch algorithm; Algorithm; Polar; Latency (audio); Arithmetic; Concatenated error correction code; Telecommunications; Block code; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0005144752,0.0001129255,0.0001949647,0.0001933179,0.0005365907,0.0002012352,0.00299754,0.00005119974,0.000001427733],"category_scores_gemma":[0.0002691293,0.0001289236,0.0000521761,0.000159837,0.0002617481,0.0009127675,0.0005148686,0.0001511636,0.000002102439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005233262,"about_ca_system_score_gemma":0.00005110519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008150893,"about_ca_topic_score_gemma":0.0002702028,"domain_scores_codex":[0.9989088,0.0001086194,0.0004378594,0.0002320523,0.0001748228,0.000137885],"domain_scores_gemma":[0.995321,0.0003414627,0.0009433668,0.003192792,0.0001532094,0.00004821967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005979035,0.00005711585,0.05661721,0.00006736277,0.00003915851,5.335526e-7,0.004086836,0.0001879994,0.8462846,0.008321307,0.001046162,0.08328568],"study_design_scores_gemma":[0.0007661801,0.00006150219,0.1149456,0.000868523,0.00007628842,0.00001792577,0.0003291309,0.2474891,0.6301877,0.0038888,0.0006701212,0.0006991779],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2985078,0.0002313392,0.695285,0.005141917,0.0001702193,0.0001587668,0.00000442752,0.0001042652,0.0003962304],"genre_scores_gemma":[0.8514653,0.0001832185,0.1482001,0.00008328118,0.00001717737,0.000008769618,0.000003623154,0.000009237982,0.00002930271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5529575,"threshold_uncertainty_score":0.5570225,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0542195442835175,"score_gpt":0.3318252000715529,"score_spread":0.2776056557880354,"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."}}