{"id":"W3115468775","doi":"10.1109/isit45174.2021.9518153","title":"Parallelism Versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; National Science Foundation","keywords":"Decoding methods; Latency (audio); Sublinear function; Binary logarithm; Parallel computing; Upper and lower bounds; List decoding; Combinatorics; Computer science; Discrete mathematics; Mathematics; Algorithm; Arithmetic; Block code; Concatenated error correction code; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004934365,0.0002634939,0.0004817602,0.0003186449,0.0000453701,0.0001641302,0.001344401,0.0003203256,0.00003593641],"category_scores_gemma":[0.0002850024,0.0002816119,0.0001340648,0.0004337323,0.00003397901,0.000299423,0.001723365,0.0005888796,0.000003159201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001811658,"about_ca_system_score_gemma":0.0003078889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002393823,"about_ca_topic_score_gemma":0.00192801,"domain_scores_codex":[0.9978592,0.0001641041,0.00060634,0.0007399344,0.0003377536,0.0002926781],"domain_scores_gemma":[0.99783,0.0004305289,0.0004395483,0.00100317,0.0002421828,0.00005454854],"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.0006193452,0.001480799,0.2093457,0.003922445,0.000750765,0.0007867437,0.04215962,0.09700909,0.05059189,0.2883084,0.002978667,0.3020465],"study_design_scores_gemma":[0.002071468,0.0002572625,0.02095658,0.002247335,0.00005268403,0.0000101366,0.0006472212,0.8325128,0.1062217,0.03259299,0.0002108529,0.002219026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2727589,0.0005616458,0.713997,0.0003668785,0.001699546,0.0003571961,0.000002980952,0.0005520737,0.009703817],"genre_scores_gemma":[0.8513074,0.0001451093,0.1483396,0.000032711,0.00003453157,0.00002318875,0.00001606704,0.00001434832,0.0000870867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7355037,"threshold_uncertainty_score":0.9999636,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04386477951458097,"score_gpt":0.3153716809634504,"score_spread":0.2715069014488694,"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."}}