{"id":"W3098807857","doi":"","title":"Fast list decoders for polar codes","year":2016,"lang":"en","type":"article","venue":"Espace ÉTS (ETS)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; List decoding; Concatenated error correction code; Polar code; Error detection and correction; Sequential decoding; Algorithm; Forward error correction; Serial concatenated convolutional codes; Berlekamp–Welch algorithm; Cyclic redundancy check; Theoretical computer science; Block code; Error floor","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.0005734944,0.0006741645,0.0003844888,0.001331627,0.0007159256,0.001337727,0.000713443,0.0007333632,0.005025597],"category_scores_gemma":[0.003676625,0.0002718164,0.0003241533,0.001107849,0.0005175094,0.001341825,0.001097461,0.0009091244,0.003304075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000705883,"about_ca_system_score_gemma":0.001405527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001560437,"about_ca_topic_score_gemma":0.002656604,"domain_scores_codex":[0.9995041,0.0001009216,0.00004351506,0.00005641324,0.0002365344,0.00005855039],"domain_scores_gemma":[0.9980616,0.0008187541,0.0002133834,0.0002493078,0.000604604,0.00005234135],"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.0007356994,0.0001184591,0.001470171,0.000393314,0.00004900881,0.0003170567,0.0003886213,0.1073221,0.08947245,0.1071697,0.01079571,0.6817678],"study_design_scores_gemma":[0.0001542944,0.0003057908,0.0004852317,0.0001223118,0.00004597086,0.0004627081,0.00009842223,0.7596725,0.1706121,0.0395609,0.02839217,0.00008760719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01399644,0.0004114284,0.9772273,0.0001531999,0.0001080356,0.00007791059,0.000142337,0.002799289,0.005084066],"genre_scores_gemma":[0.1625788,0.0006825568,0.8253523,0.0002082567,0.000130523,0.0001881516,0.0005950052,0.0003134183,0.009951053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005025597,"threshold_uncertainty_score":0.01681226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01645277043609536,"score_gpt":0.2753505181720378,"score_spread":0.2588977477359424,"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."}}