{"id":"W2051270424","doi":"10.1109/lcomm.2011.101811.111480","title":"A Simplified Successive-Cancellation Decoder for Polar Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":457,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Computer science; Block code; Algorithm; Latency (audio); Soft-decision decoder; Polar; Bit error rate; Concatenated error correction code; Linear code; Polar code; Telecommunications","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.0003571399,0.0001413695,0.0001467079,0.0001619318,0.0003840647,0.00008803119,0.003154958,0.00006110661,0.00000529271],"category_scores_gemma":[0.00009346312,0.0001522864,0.00008646347,0.00032477,0.0001186637,0.0004861999,0.0002808084,0.0001763763,0.00002164611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008179357,"about_ca_system_score_gemma":0.00004406562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002855839,"about_ca_topic_score_gemma":0.0002757873,"domain_scores_codex":[0.998925,0.0001387526,0.0002804617,0.0002818388,0.0001234029,0.0002505835],"domain_scores_gemma":[0.9963715,0.0004960168,0.0001972191,0.002722898,0.0001550281,0.00005734796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000111441,0.001065659,0.0206975,0.000157702,0.0003463132,0.000009207194,0.03843427,0.0003896856,0.413162,0.2710165,0.1298676,0.1247421],"study_design_scores_gemma":[0.002560214,0.0005063617,0.01608674,0.000407298,0.000189491,0.00006883372,0.0004500422,0.4810406,0.3466175,0.05595727,0.09277444,0.003341226],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01223396,0.0001138711,0.9784964,0.005934917,0.0002647024,0.0004259134,0.000008908242,0.0006988197,0.00182251],"genre_scores_gemma":[0.630879,0.00001956329,0.3671762,0.001692589,0.00002059457,0.0001581468,0.000009050444,0.00001390205,0.00003085541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6186451,"threshold_uncertainty_score":0.6210058,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09236214429013771,"score_gpt":0.3130310112581669,"score_spread":0.2206688669680292,"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."}}