{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004033959,0.0003298714,0.0004712483,0.0003574326,0.0003247064,0.0002090617,0.003427137,0.0003356505,0.00001425656],"category_scores_gemma":[0.0001891253,0.0004063201,0.0002249668,0.0002924557,0.0001762042,0.0005798652,0.002601683,0.0005815545,0.00001245099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002496763,"about_ca_system_score_gemma":0.0002516765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001191495,"about_ca_topic_score_gemma":0.0004626093,"domain_scores_codex":[0.9980609,0.0001424043,0.000290813,0.001037364,0.0001370385,0.0003314895],"domain_scores_gemma":[0.9961124,0.000227235,0.001084429,0.002098708,0.0003594909,0.0001177561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001976637,0.0004498966,0.1978059,0.001312393,0.000526535,0.0007634432,0.003600177,0.1977138,0.007988963,0.5647298,0.002084581,0.0228269],"study_design_scores_gemma":[0.0004505011,0.00009685859,0.003804795,0.0006352612,0.0001044747,0.000006467364,0.00009541707,0.9141926,0.01358011,0.06570393,0.0003394647,0.0009900976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2167703,0.00005943928,0.7745895,0.00006630315,0.0006498623,0.0002518476,0.00002111217,0.0004764235,0.007115142],"genre_scores_gemma":[0.9918638,0.0001070438,0.00705476,0.0000217953,0.00006845959,8.572943e-7,0.00001347288,0.00002221364,0.0008476118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7750934,"threshold_uncertainty_score":0.9998389,"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."}}