{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003662475,0.001031753,0.001549651,0.0009104464,0.001051419,0.00257071,0.001825459,0.001548881,0.003983971],"category_scores_gemma":[0.02719822,0.0007225475,0.0009201636,0.001207052,0.002276515,0.00543316,0.002196783,0.002480498,0.0004860656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00427187,"about_ca_system_score_gemma":0.004204886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008366216,"about_ca_topic_score_gemma":0.008665002,"domain_scores_codex":[0.9963529,0.001233948,0.0001411885,0.000413018,0.0010848,0.0007741807],"domain_scores_gemma":[0.9349036,0.06007376,0.001640851,0.001419769,0.00147053,0.0004915137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001221417,0.00007040954,0.002150018,0.0001847296,0.00009090484,0.000260467,0.0001876768,0.9408568,0.003556076,0.03212177,0.001726863,0.01757278],"study_design_scores_gemma":[0.00002877599,0.00003219532,0.0002472052,0.00001100304,0.00001149263,0.00003069226,0.00002576739,0.9809684,0.0009586124,0.01754977,0.0001246995,0.00001142948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5281144,0.002154123,0.4492064,0.004365004,0.000172719,0.0002050999,0.001309379,0.001345841,0.01312705],"genre_scores_gemma":[0.9494375,0.000769074,0.0443156,0.0002436589,0.0001469858,0.0002226736,0.001011447,0.0002457309,0.003607318],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008366216,"threshold_uncertainty_score":0.03099471,"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."}}