{"id":"W2230831824","doi":"10.1109/jsac.2015.2504299","title":"Fast List Decoders for Polar Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"University of California, San Diego; École Polytechnique Fédérale de Lausanne; University of Illinois at Urbana-Champaign; Centre National de la Recherche Scientifique; Center for Advanced Study, University of Illinois at Urbana-Champaign; David and Lucile Packard Foundation; National Science Foundation","keywords":"Decoding methods; List decoding; Polar code; Sequential decoding; Concatenated error correction code; Low-density parity-check code; Berlekamp–Welch algorithm; Code (set theory)","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.0005917383,0.0006772217,0.0004248593,0.00133778,0.000802532,0.001382244,0.0007138777,0.0007190072,0.004649034],"category_scores_gemma":[0.003734375,0.0002854562,0.0003356934,0.001137896,0.0005313091,0.001401032,0.001125242,0.0009403524,0.003342314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007285675,"about_ca_system_score_gemma":0.001527359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001538502,"about_ca_topic_score_gemma":0.002646163,"domain_scores_codex":[0.9994947,0.0001011315,0.00004498982,0.0000566797,0.0002423125,0.00006015047],"domain_scores_gemma":[0.9979323,0.0008217864,0.000223599,0.000269813,0.0006945596,0.00005796059],"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.0008366941,0.0001266852,0.001570838,0.0004633109,0.0000511982,0.0003652533,0.0004367501,0.1104107,0.09327234,0.1192113,0.01193561,0.6613194],"study_design_scores_gemma":[0.0001672997,0.0003441999,0.0004678436,0.0001310407,0.00004912415,0.0005308187,0.000105426,0.7557401,0.1707229,0.04214498,0.02949829,0.00009793797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01427193,0.0005084407,0.9767557,0.0001761579,0.000123063,0.00008962135,0.0001477488,0.002713699,0.005213575],"genre_scores_gemma":[0.1699179,0.0007682266,0.8189715,0.0002381826,0.0001324892,0.0001995651,0.0005673845,0.0003098424,0.008894973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004649034,"threshold_uncertainty_score":0.01555258,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0810445107494296,"score_gpt":0.3521803789829451,"score_spread":0.2711358682335155,"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."}}