{"id":"W1975650268","doi":"10.1109/tit.2013.2246815","title":"Degenerate Viterbi Decoding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Compute Canada","keywords":"Convolutional code; Sequential decoding; Algorithm; Soft output Viterbi algorithm; Decoding methods; List decoding; Computer science; Iterative Viterbi decoding; Viterbi decoder; Viterbi algorithm; Mathematics; 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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000249418,0.0001261205,0.00009024941,0.0002290817,0.0003163494,0.0003445191,0.0003879234,0.00005208058,0.0001317691],"category_scores_gemma":[0.000004169569,0.0001073732,0.00007415687,0.0002846691,0.00002737761,0.001817382,0.000003176925,0.0001985464,0.001246406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002800795,"about_ca_system_score_gemma":0.00002791432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009684975,"about_ca_topic_score_gemma":5.336554e-7,"domain_scores_codex":[0.9991639,0.00007044876,0.0002582017,0.0001199166,0.0001746326,0.0002129502],"domain_scores_gemma":[0.9993097,0.0001201663,0.00007876998,0.0003257159,0.00008066569,0.00008503172],"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.000004355602,0.00002372531,6.361198e-7,0.000009679808,0.00001480946,4.176975e-7,0.001590138,0.102752,0.0002809836,0.01814324,0.0002797462,0.8769002],"study_design_scores_gemma":[0.0002594856,0.00006565714,0.00005043096,0.00002289857,0.000003779944,0.00002589765,0.00006307624,0.962521,0.02198771,0.01349179,0.001304968,0.0002033717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02349885,0.000006908462,0.9731034,0.0003665853,0.0008079055,0.0001509875,0.000003348086,0.0003320903,0.001729928],"genre_scores_gemma":[0.9612114,0.000005273836,0.03691651,0.001582795,0.00003590924,0.00004156958,0.000001504543,0.00000588434,0.0001991419],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9377126,"threshold_uncertainty_score":0.9995312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006319225856570922,"score_gpt":0.2022957069418615,"score_spread":0.1959764810852906,"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."}}