{"id":"W4405717973","doi":"10.1109/lcomm.2024.3521080","title":"Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Polar; Latency (audio); Forward error correction; Computer network; Telecommunications; Arithmetic; Mathematics","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.0002221752,0.0003929175,0.0001964597,0.0002877509,0.000220752,0.0003472524,0.0002914476,0.0002844803,0.0008177306],"category_scores_gemma":[0.0007374992,0.0001194151,0.0001669849,0.0003262591,0.0002336646,0.0002675129,0.0002819091,0.0003297815,0.0002755215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000368093,"about_ca_system_score_gemma":0.00103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001433575,"about_ca_topic_score_gemma":0.003033119,"domain_scores_codex":[0.9998215,0.00004576966,0.000006701106,0.00001930577,0.00007961378,0.00002719444],"domain_scores_gemma":[0.9997239,0.0001187953,0.00004709803,0.00002123004,0.00007949775,0.000009597387],"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.0002485584,0.00006302091,0.001327061,0.0001399557,0.00003321849,0.0002067703,0.0001474446,0.6948041,0.1243423,0.04075135,0.001135916,0.1368003],"study_design_scores_gemma":[0.00003378359,0.0001703219,0.0002188591,0.00001166409,0.00001422845,0.00009656503,0.00002890559,0.9516401,0.04177832,0.003933974,0.002060686,0.00001261721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.165895,0.0002942391,0.8262635,0.0001567195,0.00004715635,0.00006339054,0.00008314566,0.0005030788,0.006693739],"genre_scores_gemma":[0.6322993,0.0002651714,0.3642976,0.00007700729,0.00001722025,0.00006331476,0.0001230388,0.00006339941,0.002793983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001433575,"threshold_uncertainty_score":0.002850413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03960159787015575,"score_gpt":0.3286500417338338,"score_spread":0.289048443863678,"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."}}