{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004013557,0.00104417,0.001589155,0.0009348294,0.001006846,0.002557751,0.001774649,0.001594122,0.00392866],"category_scores_gemma":[0.02967488,0.0007253903,0.000874104,0.001241235,0.002124032,0.005169992,0.002170619,0.002433299,0.0004955416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003934163,"about_ca_system_score_gemma":0.003988928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007711474,"about_ca_topic_score_gemma":0.008413192,"domain_scores_codex":[0.9961732,0.001368566,0.0001502166,0.0004100385,0.001164377,0.0007335805],"domain_scores_gemma":[0.9304464,0.06447684,0.001705543,0.001443049,0.001450289,0.0004778848],"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.00138826,0.00007048116,0.002408257,0.000204449,0.00009887656,0.0002771132,0.0001981045,0.9354039,0.003366107,0.035046,0.001862535,0.01967595],"study_design_scores_gemma":[0.00003076511,0.00003415705,0.0002744121,0.00001285914,0.00001286401,0.00003486121,0.00002565176,0.9791206,0.0009556778,0.01935355,0.0001327891,0.00001180778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5004908,0.002222548,0.4776818,0.004168669,0.000163878,0.0001848703,0.001345883,0.001290693,0.01245081],"genre_scores_gemma":[0.9433462,0.0008265931,0.05026002,0.0002310192,0.000160558,0.000216364,0.001153652,0.0002406085,0.003564999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007711474,"threshold_uncertainty_score":0.02854449,"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."}}