{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000323707,0.0004533955,0.0003088365,0.0004637356,0.0003669625,0.0007051919,0.0005014302,0.0002894902,0.001051371],"category_scores_gemma":[0.001942868,0.000147248,0.0002264324,0.0006684609,0.0004932026,0.0004876237,0.0005931663,0.000553507,0.0005747497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005061284,"about_ca_system_score_gemma":0.001752749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002133453,"about_ca_topic_score_gemma":0.003800796,"domain_scores_codex":[0.9995034,0.00009451786,0.00001866295,0.00005440598,0.0002553409,0.00007361227],"domain_scores_gemma":[0.9991627,0.0003146693,0.00009429427,0.0001427769,0.0002551317,0.00003044967],"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.0005623248,0.00008338172,0.002236506,0.000356305,0.00005881022,0.0005241113,0.0003127316,0.4154234,0.1816199,0.06808249,0.004247469,0.3264926],"study_design_scores_gemma":[0.00002048615,0.00007172859,0.0002465241,0.00001776879,0.00001347526,0.0002073966,0.00001996098,0.9042501,0.08476752,0.007715195,0.002653117,0.0000167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04435338,0.0003554398,0.9465702,0.0002126168,0.00005977342,0.00004587487,0.0001282234,0.00104339,0.007231205],"genre_scores_gemma":[0.787938,0.0005508906,0.2060684,0.0001630817,0.00005536787,0.0000622896,0.0003216932,0.0001099664,0.004730421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002133453,"threshold_uncertainty_score":0.004242003,"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."}}