{"id":"W2972671693","doi":"10.1109/twc.2020.3022922","title":"Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; National Science Foundation","keywords":"Sublinear function; Decoding methods; Latency (audio); Algorithm; Computer science; Polar; Mathematics; Upper and lower bounds; Discrete mathematics; Telecommunications; Physics","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.001558549,0.001152593,0.0005295976,0.0007426788,0.0005690831,0.001724387,0.0006626235,0.0005122118,0.00408808],"category_scores_gemma":[0.01039855,0.0003958628,0.0004154025,0.0008866489,0.001490208,0.002359857,0.001069946,0.001435683,0.0008900791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002624335,"about_ca_system_score_gemma":0.003389057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004587732,"about_ca_topic_score_gemma":0.0046092,"domain_scores_codex":[0.9982582,0.0003031774,0.0000599043,0.0001347622,0.000854206,0.0003898465],"domain_scores_gemma":[0.9927482,0.005068462,0.0005272118,0.0005804927,0.0009516485,0.0001239838],"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.0006269358,0.00007451735,0.001314779,0.0003341589,0.00004528089,0.0003005562,0.000383536,0.6804361,0.03592272,0.2219644,0.002668592,0.05592832],"study_design_scores_gemma":[0.00002148456,0.0001149561,0.000231065,0.00003267462,0.0000171957,0.0001331383,0.00006407907,0.9447975,0.01339352,0.03921017,0.0019581,0.0000261038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09396742,0.001907683,0.8860029,0.0005508918,0.0001450821,0.000103589,0.0001879736,0.000738217,0.0163962],"genre_scores_gemma":[0.9023262,0.002921722,0.08431733,0.0003351521,0.0001850743,0.0002169476,0.0003372802,0.0002235893,0.009136604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004587732,"threshold_uncertainty_score":0.01904094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0733727783293457,"score_gpt":0.3351965098153082,"score_spread":0.2618237314859625,"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."}}