{"id":"W2923621805","doi":"10.1109/tcomm.2019.2906232","title":"Fast Successive-Cancellation-Based Decoders of Polar Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; Sequential decoding; List decoding; Polar code; Algorithm; Latency (audio); Code (set theory); Parallel computing; Reduction (mathematics); Berlekamp–Welch algorithm; Concatenated error correction code; Mathematics; Telecommunications; Block code; Set (abstract data type)","routes":{"ca_aff":true,"ca_fund":true,"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.0007105356,0.0006175169,0.000412541,0.001101099,0.0004497345,0.000760705,0.0006731344,0.0004648527,0.002814992],"category_scores_gemma":[0.002362015,0.0002957557,0.000334408,0.0008022464,0.0004589376,0.0009314753,0.0007503151,0.0007606101,0.00112983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006937036,"about_ca_system_score_gemma":0.001641317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002419241,"about_ca_topic_score_gemma":0.004010619,"domain_scores_codex":[0.9993874,0.0001316748,0.00004061882,0.00005546451,0.0003139981,0.00007076896],"domain_scores_gemma":[0.9983851,0.0005697195,0.0001346277,0.0002097525,0.0006537712,0.00004712152],"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.0009784208,0.0001162791,0.00197073,0.0004029796,0.0000796582,0.0004633424,0.0003332499,0.1307914,0.2359238,0.07660488,0.005701277,0.5466341],"study_design_scores_gemma":[0.00009804212,0.0003024533,0.0005521805,0.00004886165,0.00003572797,0.0004420257,0.00005318499,0.7022778,0.2717708,0.01302162,0.01134009,0.00005723782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0543311,0.0004751434,0.9358335,0.000191836,0.0001134821,0.0001067983,0.0001939839,0.001706253,0.007048025],"genre_scores_gemma":[0.3876799,0.0005918041,0.6036621,0.0002063728,0.00009479111,0.0001384731,0.0004756284,0.0001580856,0.006992755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002814992,"threshold_uncertainty_score":0.009417057,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02210518038164526,"score_gpt":0.283981946344798,"score_spread":0.2618767659631527,"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."}}