{"id":"W2949743890","doi":"10.48550/arxiv.1701.08126","title":"Fast Simplified Successive-Cancellation List Decoding of Polar Codes","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Algorithm; Node (physics); Computer science; Polar code; Polar; List decoding; Set (abstract data type); Code (set theory); Word error rate; Error detection and correction; Concatenated error correction code; Block code; Physics; Speech recognition","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.001024856,0.0008424461,0.0006080197,0.001128616,0.0006050832,0.001216123,0.001042564,0.0005795753,0.002719912],"category_scores_gemma":[0.006103743,0.0002931305,0.0004748637,0.001197135,0.0008324118,0.001341432,0.001206178,0.001085959,0.001921971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008538797,"about_ca_system_score_gemma":0.002509222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003108747,"about_ca_topic_score_gemma":0.004362722,"domain_scores_codex":[0.9985558,0.0003494914,0.00006261496,0.0001200044,0.0007732995,0.0001388358],"domain_scores_gemma":[0.9957753,0.001720479,0.0003595553,0.0007079082,0.001363466,0.00007336037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000686783,0.00009150594,0.002083905,0.0004019362,0.0000745955,0.0006540209,0.0004343204,0.4971531,0.08014104,0.1144467,0.006163174,0.297669],"study_design_scores_gemma":[0.00005226419,0.0001668047,0.0002933124,0.00004115562,0.00002335282,0.0004023976,0.00004938228,0.9144903,0.05879308,0.0185091,0.007137866,0.00004093419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02516068,0.0003004054,0.9672404,0.0001814842,0.00005992103,0.00009078541,0.0001847688,0.0009237109,0.005857837],"genre_scores_gemma":[0.358063,0.0007425944,0.6303045,0.0002357225,0.00008333986,0.0001648431,0.0008988397,0.0001683152,0.009338899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003108747,"threshold_uncertainty_score":0.009099007,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08685566390040513,"score_gpt":0.2325502243839907,"score_spread":0.1456945604835856,"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."}}