{"id":"W2130279916","doi":"10.1109/tit.2004.833337","title":"Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Redundancy (engineering); Algorithm; Encoder; Computer science; Markov process; Computational complexity theory; Markov chain; Maximum a posteriori estimation; A priori and a posteriori; Channel (broadcasting); Mathematics; Telecommunications; Maximum likelihood; 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.0008518996,0.0007503734,0.0008307648,0.0003676549,0.0002813393,0.0006749903,0.0006537657,0.0008192273,0.0008060472],"category_scores_gemma":[0.003609276,0.0003724542,0.0004603403,0.0005453367,0.0006548857,0.00116214,0.0007643758,0.0007791682,0.0002970341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006637391,"about_ca_system_score_gemma":0.0009469431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003022876,"about_ca_topic_score_gemma":0.003171061,"domain_scores_codex":[0.9996113,0.0001589516,0.00002109041,0.00005248045,0.0001060184,0.00005011092],"domain_scores_gemma":[0.9983159,0.001260565,0.0001444628,0.0001188199,0.0001366317,0.00002360522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001492342,0.00002019687,0.0003311692,0.00006949447,0.00002779748,0.00009168127,0.00008250036,0.9246523,0.005336406,0.0345211,0.000454137,0.03426395],"study_design_scores_gemma":[0.000004813218,0.00001095646,0.00003168905,0.000003546169,0.000002733288,0.00002076988,0.00000428277,0.9926684,0.001897549,0.005218045,0.0001331151,0.000003968355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02026692,0.0001976047,0.9784078,0.00008273955,0.000008463719,0.00001093244,0.00004284794,0.0001864143,0.0007962872],"genre_scores_gemma":[0.725987,0.0008476079,0.2685462,0.00007200357,0.00004074958,0.00007538011,0.0002673747,0.00008191218,0.004081757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003022876,"threshold_uncertainty_score":0.006010592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01459078337829266,"score_gpt":0.2393267624969861,"score_spread":0.2247359791186934,"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."}}