{"id":"W2802514696","doi":"10.1109/tcomm.2018.2832207","title":"Decoder Partitioning: Towards Practical List Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Computer science; List decoding; Sequential decoding; Polar; Algorithm; Concatenated error correction code; Electronic engineering; Theoretical computer science; Parallel computing; Block code; Engineering","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.0008356781,0.001211839,0.0008322095,0.0008631085,0.0005992602,0.001279607,0.001111844,0.0008200114,0.002299966],"category_scores_gemma":[0.005325581,0.0004359357,0.0004327963,0.001041223,0.0007091961,0.001618533,0.002350683,0.001291265,0.001983159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007020336,"about_ca_system_score_gemma":0.001970521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001397931,"about_ca_topic_score_gemma":0.002180059,"domain_scores_codex":[0.998673,0.0004522198,0.00009186457,0.0001473251,0.0004710403,0.000164489],"domain_scores_gemma":[0.9975334,0.001221444,0.0001624779,0.000436611,0.0005663686,0.00007970408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009904149,0.0001659989,0.001032375,0.0006348646,0.00006969854,0.0006699626,0.0005310399,0.3440015,0.1039644,0.1217608,0.008406311,0.4177726],"study_design_scores_gemma":[0.00009479633,0.0002298275,0.0001753705,0.00006474753,0.00002637291,0.0003609853,0.0001013535,0.89044,0.04893162,0.05166973,0.007869699,0.00003546823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01119519,0.0002351499,0.9852338,0.0001515937,0.00003265712,0.00006797804,0.0001054948,0.0006442255,0.002333861],"genre_scores_gemma":[0.1781968,0.0005896994,0.8168149,0.000311994,0.00009790566,0.0002235243,0.000603168,0.0002049373,0.002957084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002299966,"threshold_uncertainty_score":0.007694125,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08444422761163856,"score_gpt":0.3729335643544408,"score_spread":0.2884893367428022,"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."}}