{"id":"W4415364448","doi":"10.1007/s11265-025-01969-4","title":"On Reducing Decoding Complexity of Successive-Cancellation List Flip Decoding of Polar Codes","year":2025,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Sequential decoding; List decoding; Coding (social sciences); Berlekamp–Welch algorithm; Metric (unit); Computational complexity theory; Partition (number theory)","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.001051366,0.001333764,0.000918653,0.0009189726,0.0008305486,0.001496548,0.000921202,0.0007354519,0.004147551],"category_scores_gemma":[0.008244043,0.0003539349,0.000594457,0.001339311,0.0008705396,0.001595346,0.001466137,0.001498827,0.001130095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00109746,"about_ca_system_score_gemma":0.003218124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005342473,"about_ca_topic_score_gemma":0.008263349,"domain_scores_codex":[0.99767,0.0006660256,0.00008331782,0.0001867303,0.001070881,0.0003230225],"domain_scores_gemma":[0.9941366,0.00415675,0.0002031441,0.0005665269,0.0008612707,0.00007578629],"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.001403106,0.0001886541,0.001750771,0.0004163651,0.0001195436,0.0003933394,0.0003751841,0.4321079,0.05516749,0.1023671,0.0106887,0.3950218],"study_design_scores_gemma":[0.00005497388,0.0001326711,0.0005127348,0.00004039323,0.0000417209,0.0001891001,0.00006511472,0.9458718,0.02192607,0.02810933,0.003029204,0.00002686449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08134949,0.001122374,0.9014905,0.0007770024,0.0002748078,0.0001528116,0.0003271092,0.001209639,0.01329629],"genre_scores_gemma":[0.5671187,0.001835441,0.4164179,0.0004780295,0.0003618197,0.0002553225,0.0009136417,0.0003624549,0.0122567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005342473,"threshold_uncertainty_score":0.01387495,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03908256154485173,"score_gpt":0.3116236819265678,"score_spread":0.272541120381716,"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."}}