{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00208022,0.0001896367,0.0006468259,0.0006869023,0.0002137646,0.0002032138,0.0009305976,0.0001014463,0.000002553264],"category_scores_gemma":[0.0003428262,0.0001700041,0.0001447305,0.0008533172,0.0001289631,0.0007475695,0.000108781,0.0003657902,3.286889e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000237371,"about_ca_system_score_gemma":0.0004401178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002056332,"about_ca_topic_score_gemma":0.000009997742,"domain_scores_codex":[0.9972914,0.0002227892,0.001376558,0.0002518479,0.0006247949,0.000232543],"domain_scores_gemma":[0.9953133,0.0005615628,0.002740481,0.0002529759,0.00106542,0.00006629603],"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.0004677792,0.0006099406,0.02795609,0.008261953,0.0003386739,0.00006715488,0.007599393,0.04768048,0.6662772,0.06534105,0.001627709,0.1737725],"study_design_scores_gemma":[0.0007487536,0.0006008093,0.001016259,0.02755607,0.00007167731,0.0001300161,0.0005957094,0.7129534,0.2483503,0.007533689,0.00006066724,0.0003826646],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2224081,0.001817767,0.7733722,0.0001415297,0.0006028036,0.0001385287,0.000001678261,0.00006630145,0.001451109],"genre_scores_gemma":[0.9727148,0.00001093823,0.02707745,0.00002279982,0.0001081294,0.000001811432,3.649769e-7,0.00001212764,0.00005151213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7503068,"threshold_uncertainty_score":0.6932566,"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."}}