{"id":"W2333338207","doi":"10.1049/iet-com.2015.0881","title":"Decoding schedule generating method for successive‐cancellation decoder of polar codes","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; University of Toronto; Harbin Institute of Technology; National Natural Science Foundation of China","keywords":"Decoding methods; Computer science; Schedule; Polar; Algorithm; Sequential decoding; Arithmetic; Mathematics; Block code","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003420291,0.0007541243,0.0003382117,0.0007811856,0.0005244804,0.0003884568,0.0005711948,0.0003332082,0.003649099],"category_scores_gemma":[0.001430212,0.0002270074,0.0004141363,0.000577674,0.0002901974,0.0004974609,0.0005174675,0.0005834815,0.001166862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005037001,"about_ca_system_score_gemma":0.001846974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003801134,"about_ca_topic_score_gemma":0.004134178,"domain_scores_codex":[0.9995195,0.00009075004,0.00002878747,0.00007094639,0.0002493331,0.00004065023],"domain_scores_gemma":[0.9994792,0.0001511535,0.00004367208,0.00007483953,0.0002297705,0.00002132064],"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.0004001658,0.00008263982,0.001025859,0.0002664921,0.0000440098,0.0003684408,0.0003800299,0.185831,0.1024593,0.05317435,0.006539787,0.649428],"study_design_scores_gemma":[0.00008494148,0.0001731574,0.0003609591,0.00002212552,0.00003149249,0.0004239398,0.00004690704,0.9232394,0.05679629,0.009893464,0.008885277,0.00004202066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005331452,0.00006985274,0.9919911,0.00004197607,0.00003593921,0.0000574667,0.00004621292,0.0005065997,0.001919318],"genre_scores_gemma":[0.1850409,0.0003249744,0.8072507,0.00009518451,0.00008357685,0.00022438,0.0004689071,0.0001788018,0.006332582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003801134,"threshold_uncertainty_score":0.01220739,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05541009581613126,"score_gpt":0.377487737016906,"score_spread":0.3220776412007747,"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."}}