{"id":"W3120100215","doi":"10.1109/lcomm.2021.3051463","title":"Input-Distribution-Aware Successive Cancellation List Decoding of Polar Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Decoding methods; Computer science; Polar code; Reduction (mathematics); Code (set theory); Parallel computing; List decoding; Algorithm; Latency (audio); Block (permutation group theory); Set (abstract data type); Block code; Concatenated error correction code; Telecommunications; 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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005358012,0.0003101036,0.0004643846,0.0002306371,0.0003830565,0.0003240477,0.005645956,0.0002497782,0.000006744228],"category_scores_gemma":[0.0002450183,0.0003826443,0.0002179493,0.0006422884,0.0002645901,0.000376515,0.003380368,0.001097705,0.000003438222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005017583,"about_ca_system_score_gemma":0.0003897726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002513372,"about_ca_topic_score_gemma":0.001392982,"domain_scores_codex":[0.9974974,0.0005607178,0.0007140945,0.0005825322,0.0003582735,0.0002869308],"domain_scores_gemma":[0.9918036,0.0007519499,0.0009289663,0.0058045,0.0006359376,0.00007508452],"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.00006316859,0.00252511,0.1077669,0.003910967,0.002359203,0.0001733536,0.04997418,0.06890722,0.4761073,0.04971548,0.1419444,0.09655277],"study_design_scores_gemma":[0.0008077394,0.0001028542,0.006557157,0.005698332,0.0003025737,0.00008181921,0.0008420619,0.7322429,0.2385691,0.003257739,0.008058407,0.003479388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06475564,0.0009971736,0.9204808,0.01151958,0.0009075319,0.0003900835,0.0001512445,0.0005551639,0.0002427237],"genre_scores_gemma":[0.8978459,0.0003925126,0.100297,0.0005898256,0.0000537434,0.0001098117,0.0006731892,0.00002436974,0.00001361511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8330903,"threshold_uncertainty_score":0.9998626,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03907823316342272,"score_gpt":0.3139491033952214,"score_spread":0.2748708702317986,"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."}}