{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004821054,0.0002049805,0.0002073512,0.0001515386,0.0001793091,0.0001492488,0.00113045,0.0001026374,0.0000216858],"category_scores_gemma":[0.0004123489,0.000154249,0.0001191242,0.0002610361,0.00007552137,0.0005226865,0.0002707427,0.0001003969,0.000104047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001111252,"about_ca_system_score_gemma":0.00008225842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001004325,"about_ca_topic_score_gemma":0.0005421121,"domain_scores_codex":[0.998489,0.00006514341,0.0001918905,0.000535938,0.0002439671,0.0004741217],"domain_scores_gemma":[0.9982985,0.0004509114,0.0001276119,0.0008512191,0.0001387848,0.000132929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001332872,0.0003106504,0.02322358,0.0001167231,0.0001231982,0.00005201212,0.006704127,0.00002966181,0.1191276,0.1725426,0.2581846,0.419452],"study_design_scores_gemma":[0.002656891,0.001144574,0.005868965,0.0007428732,0.00005363833,0.0001384404,0.000433419,0.02137588,0.4139785,0.03202732,0.5190684,0.002511138],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01607044,0.00009918708,0.9703311,0.009073487,0.0006518097,0.0003397376,0.00001702992,0.001292104,0.002125059],"genre_scores_gemma":[0.8009925,0.00002022838,0.1930204,0.0005652796,0.0001365213,0.00007244773,0.000001572582,0.00003659231,0.005154362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7849221,"threshold_uncertainty_score":0.629009,"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."}}