{"id":"W2073350441","doi":"10.1002/ett.1169","title":"Vector quantisation for finite‐state Markov channels and application to wireless communications","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Decoding methods; Algorithm; Fading; Channel (broadcasting); Maximum a posteriori estimation; Computer science; Markov chain; Channel state information; Markov process; Markov model; Wireless; Hidden Markov model; Electronic engineering; Speech recognition; Mathematics; Telecommunications; Engineering; Statistics; Maximum likelihood","routes":{"ca_aff":true,"ca_fund":true,"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.001195449,0.0003177662,0.0004485689,0.0003365058,0.0002552431,0.0007571945,0.0005540003,0.0004832128,0.001394751],"category_scores_gemma":[0.004123914,0.0002098219,0.0002182579,0.000593966,0.0006372833,0.0007056469,0.0005240838,0.0007137695,0.0001967013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007883113,"about_ca_system_score_gemma":0.0008565203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003284605,"about_ca_topic_score_gemma":0.002374672,"domain_scores_codex":[0.9993449,0.0002237036,0.0000420783,0.00007709159,0.0002622293,0.0000500862],"domain_scores_gemma":[0.9981421,0.001291908,0.0001427886,0.0001328502,0.0002680074,0.00002234538],"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.0001334758,0.00003021703,0.0003723598,0.0001210928,0.00002973591,0.00007281281,0.0001155524,0.7459414,0.00876647,0.1113342,0.001458673,0.131624],"study_design_scores_gemma":[0.000007175233,0.00002009579,0.00004106423,0.00000988219,0.000003678098,0.0000156787,0.000005771491,0.987709,0.001850218,0.009650053,0.0006814839,0.000005801727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01315498,0.0006626627,0.9844044,0.0002013383,0.00004585709,0.00002893467,0.00003753692,0.0002347031,0.001229594],"genre_scores_gemma":[0.8133304,0.0009268485,0.1828966,0.0001122204,0.00008429821,0.0001243871,0.0001440815,0.00003823602,0.002343078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003284605,"threshold_uncertainty_score":0.006530941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02581371447252368,"score_gpt":0.3026467157225275,"score_spread":0.2768330012500038,"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."}}