{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000410883,0.000159873,0.0001509976,0.0002417783,0.0004446821,0.0004412742,0.002349858,0.00006778906,0.000003274687],"category_scores_gemma":[0.00009050971,0.0001701999,0.000107023,0.0005527684,0.0001007264,0.0006991827,0.0002722319,0.000286427,0.00001495695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002053698,"about_ca_system_score_gemma":0.000101446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003214503,"about_ca_topic_score_gemma":0.000251028,"domain_scores_codex":[0.9987806,0.0001337623,0.000306122,0.0003700146,0.000147935,0.0002615566],"domain_scores_gemma":[0.9968545,0.0008471283,0.0001079424,0.002000887,0.0001355087,0.00005405412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001569817,0.0001513744,0.0004324288,0.0002348021,0.0002117144,0.00001570981,0.01611876,0.004532559,0.7682259,0.06393077,0.08339687,0.06273343],"study_design_scores_gemma":[0.0001974731,0.00005344009,0.0001056726,0.0004509153,0.00005043609,0.00002329768,0.0000797037,0.9044962,0.05911185,0.003163304,0.03166781,0.000599883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01059462,0.001510603,0.9486652,0.03588114,0.0008025171,0.0004269963,0.00001418696,0.001384152,0.0007205989],"genre_scores_gemma":[0.6535999,0.0001043015,0.3450563,0.0008866357,0.00005771368,0.0001673875,0.00001963662,0.00002267914,0.00008551699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8999637,"threshold_uncertainty_score":0.6940551,"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."}}