{"id":"W3182656491","doi":"10.1109/lcomm.2021.3095895","title":"Sequential Decoding of Short Length Binary Codes: Performance Versus Complexity","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequential decoding; Convolutional code; Decoding methods; List decoding; Algorithm; Computer science; Viterbi algorithm; Metric (unit); Viterbi decoder; Serial concatenated convolutional codes; Block code; Theoretical computer science; Concatenated error correction code","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003968304,0.0001422256,0.0002101058,0.0001368262,0.0003311656,0.00006944372,0.002905762,0.00005295231,0.000007517008],"category_scores_gemma":[0.00007001471,0.0001690251,0.000100475,0.0006191203,0.0003027314,0.000456539,0.001001476,0.000342931,0.00001246299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001294392,"about_ca_system_score_gemma":0.0001122896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005860214,"about_ca_topic_score_gemma":0.0001080834,"domain_scores_codex":[0.9985995,0.0002692605,0.0003623006,0.0002870264,0.0002445563,0.0002373187],"domain_scores_gemma":[0.9958559,0.0003876431,0.000125256,0.003384077,0.0001936993,0.00005340719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006765919,0.0007152906,0.01230901,0.0001680001,0.000285218,0.00004198774,0.004757877,0.001525135,0.8780636,0.02542398,0.01205105,0.0645912],"study_design_scores_gemma":[0.001046373,0.0002530497,0.008962172,0.0004180092,0.00008803698,0.000124046,0.0003098294,0.360977,0.6187766,0.0004513308,0.007520106,0.001073465],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8139083,0.0002088346,0.1760072,0.005579237,0.0008150301,0.0001551472,0.000006851296,0.0005409742,0.002778397],"genre_scores_gemma":[0.767079,0.0001640567,0.2322985,0.0003805513,0.00002090198,0.00002070125,0.00001441098,0.00001066655,0.0000112192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3594519,"threshold_uncertainty_score":0.6892645,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1465499484322786,"score_gpt":0.345389028460019,"score_spread":0.1988390800277404,"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."}}