{"id":"W2056299877","doi":"10.1109/isit.2005.1523628","title":"On the complexity of joint source-channel decoding of markov sequences over memoryless channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Viterbi algorithm; Decoding methods; Convolutional code; Algorithm; Source code; Markov chain; Computer science; Markov process; Discrete mathematics; Tree (set theory); Mathematics; Combinatorics; Statistics","routes":{"ca_aff":true,"ca_fund":false,"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.001009214,0.000154845,0.0002658938,0.000139907,0.0001020351,0.0000410001,0.001100893,0.0000554423,0.0001004047],"category_scores_gemma":[0.0001551529,0.0001043999,0.0001182129,0.0003218654,0.0002635854,0.0002152328,0.0003837887,0.0001637912,0.000007813385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000501736,"about_ca_system_score_gemma":0.0000373508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003482007,"about_ca_topic_score_gemma":0.0001099012,"domain_scores_codex":[0.9985318,0.000129703,0.000390125,0.0003001893,0.0004030988,0.000245068],"domain_scores_gemma":[0.998498,0.0003574995,0.0002859655,0.0006928233,0.0001191435,0.00004655009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000436512,0.0005256291,0.000677094,0.0001410753,0.0001018935,0.000006003291,0.01290548,0.004347953,0.03637412,0.8844531,0.01198833,0.04843565],"study_design_scores_gemma":[0.0001488886,0.0001881501,0.000659051,0.0001734665,0.000006308277,0.00001521077,0.0002707949,0.3240702,0.6197945,0.05434094,0.00009008528,0.0002424374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4192618,0.0000314569,0.5660595,0.003193568,0.0002667323,0.0002807353,0.000001965265,0.0003544122,0.01054983],"genre_scores_gemma":[0.9625369,0.000004974214,0.03663937,0.0004999881,0.00004441771,0.000009843976,2.533233e-7,0.000009169355,0.0002550565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8301122,"threshold_uncertainty_score":0.4257304,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08727047721142209,"score_gpt":0.287291421623702,"score_spread":0.2000209444122799,"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."}}