{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010887,0.001002064,0.0006446151,0.0006406292,0.0005085412,0.001293846,0.0005537795,0.0008822432,0.001653242],"category_scores_gemma":[0.005739834,0.0002199559,0.0003021867,0.000919838,0.0008619325,0.001251285,0.0009524911,0.000627677,0.0005674484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001033544,"about_ca_system_score_gemma":0.001809976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326653,"about_ca_topic_score_gemma":0.004186943,"domain_scores_codex":[0.9987618,0.0003350456,0.00005700891,0.0001496639,0.0005418509,0.0001546231],"domain_scores_gemma":[0.9943559,0.003488986,0.0004967063,0.0005252617,0.001028498,0.0001046208],"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.001578968,0.0001003295,0.003805083,0.0003973493,0.00009485761,0.0003448811,0.0001980051,0.6051131,0.0936796,0.05596499,0.001503953,0.2372189],"study_design_scores_gemma":[0.00001938504,0.0003648881,0.0003640253,0.00002868839,0.00001937913,0.0003144012,0.00004001682,0.9501228,0.03690812,0.01086013,0.0009354709,0.00002258716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2241752,0.001294293,0.7622795,0.0003771816,0.00009568622,0.0001034188,0.0001754322,0.0008224958,0.0106768],"genre_scores_gemma":[0.8395486,0.0008644412,0.1555616,0.00008754801,0.0000730848,0.00008229364,0.0002632094,0.00008660863,0.003432733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002326653,"threshold_uncertainty_score":0.00749892,"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."}}