{"id":"W2039436865","doi":"10.1109/tcomm.2008.060315","title":"On the complexity of joint source-channel decoding of Markov sequences over memoryless channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Convolutional code; Decoding methods; Viterbi algorithm; Algorithm; Source code; Markov process; Computer science; Markov chain; Viterbi decoder; Discrete mathematics; Mathematics; Theoretical computer science; 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.000550577,0.0001682346,0.0002650511,0.0002600824,0.0007697014,0.00002406556,0.002480578,0.00007250868,0.00003099172],"category_scores_gemma":[0.00004034193,0.000140969,0.0001906423,0.0006673096,0.0009141474,0.000202361,0.00003738014,0.0004558644,0.000008432698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007195459,"about_ca_system_score_gemma":0.00008766416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005089635,"about_ca_topic_score_gemma":0.0002081626,"domain_scores_codex":[0.9983785,0.0003734853,0.0004698768,0.0002410869,0.0003408282,0.0001962436],"domain_scores_gemma":[0.9955058,0.001085511,0.0003019081,0.002854708,0.0001988959,0.00005324351],"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.0002962257,0.01314967,0.0003532624,0.0004302684,0.001337743,0.00001798591,0.1226175,0.1336319,0.1045198,0.529926,0.009398052,0.08432154],"study_design_scores_gemma":[0.000505891,0.0005467558,0.0007726932,0.0005544506,0.00005553797,0.0001010766,0.0008140259,0.4335492,0.5214776,0.04081261,0.0002028285,0.0006073015],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05112594,0.00004964638,0.9429273,0.00307371,0.0002717171,0.0003374761,0.00001859708,0.0002682643,0.001927343],"genre_scores_gemma":[0.9754402,0.0001962129,0.02395962,0.0001745626,0.000007322481,0.00008208593,0.0000010522,0.0000147361,0.0001242059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9243143,"threshold_uncertainty_score":0.5919998,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1627902612651954,"score_gpt":0.3071654428613609,"score_spread":0.1443751815961655,"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."}}