{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158585,0.001127103,0.0006274389,0.0006577088,0.0005765131,0.001427484,0.0008626612,0.0004687166,0.003099227],"category_scores_gemma":[0.01065685,0.0003426514,0.0003009634,0.001151874,0.001088201,0.002507365,0.001258634,0.0008205152,0.0007615166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001530636,"about_ca_system_score_gemma":0.003795177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00288043,"about_ca_topic_score_gemma":0.00363778,"domain_scores_codex":[0.9975533,0.0004660957,0.0001115057,0.0002782991,0.001039801,0.0005509177],"domain_scores_gemma":[0.9932231,0.004236395,0.0006323098,0.0008070653,0.0009330648,0.000168119],"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.00196468,0.0001428794,0.002874029,0.0003384121,0.00006240568,0.0004637866,0.0003524393,0.7253409,0.0722425,0.09867365,0.001910194,0.09563414],"study_design_scores_gemma":[0.00006482504,0.0002903141,0.0006104573,0.00003002622,0.00002629111,0.0002263896,0.00007576206,0.9482523,0.0208875,0.02786879,0.001635273,0.0000320678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2434217,0.001586314,0.7391394,0.0006613604,0.0001127391,0.0002123321,0.0003252092,0.0009369092,0.01360404],"genre_scores_gemma":[0.9168722,0.001482166,0.07604361,0.0001347454,0.0001387216,0.000187018,0.0003133424,0.0001612909,0.004666919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003099227,"threshold_uncertainty_score":0.01110554,"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."}}