{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002391764,0.0001495165,0.0001996032,0.0003036213,0.0002776088,0.00005258836,0.002285315,0.00008370901,0.00005874684],"category_scores_gemma":[0.00001265831,0.0001633351,0.0001325214,0.0007167449,0.0001285371,0.0003305316,0.00001205216,0.0003370277,0.00008328546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009294413,"about_ca_system_score_gemma":0.0001832108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002738723,"about_ca_topic_score_gemma":0.0005305918,"domain_scores_codex":[0.9987723,0.0001864962,0.0003441664,0.0002673941,0.0002453483,0.000184351],"domain_scores_gemma":[0.9954559,0.0009569162,0.0002022816,0.003092938,0.000231002,0.00006099942],"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.0001817937,0.005921138,0.01242304,0.0004051485,0.0005797162,0.000003946808,0.01060863,0.4495889,0.1233584,0.09022235,0.001864383,0.3048425],"study_design_scores_gemma":[0.000619187,0.0002636091,0.0006300501,0.0001962698,0.00003255772,0.000004015795,0.0001518121,0.8383983,0.1559965,0.001550404,0.00169807,0.0004592279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005130132,0.00007679701,0.9875793,0.001598233,0.0002838481,0.0003236724,0.00002669086,0.0004621541,0.004519191],"genre_scores_gemma":[0.8770241,0.00004594413,0.1224468,0.0001489599,0.000003642523,0.00005195737,0.000004507967,0.00001561692,0.000258517],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8718939,"threshold_uncertainty_score":0.6660613,"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."}}