{"id":"W2130433054","doi":"10.1109/isit.2007.4557340","title":"Ordering Finite-State Markov Channels by Mutual Information","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Mutual information; Markov chain; Decoding methods; Markov process; Computer science; Channel (broadcasting); Markov model; Channel capacity; Low-density parity-check code; Algorithm; Finite state; Mathematics; Theoretical computer science; Statistics; Telecommunications; Artificial intelligence","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.0037334,0.0008920748,0.001247958,0.001519348,0.00100311,0.001908964,0.001085227,0.0007680711,0.002521764],"category_scores_gemma":[0.01285409,0.0007138766,0.0007615979,0.00185095,0.00340988,0.005069722,0.001906597,0.001727478,0.0003248125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002029753,"about_ca_system_score_gemma":0.002032024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001608082,"about_ca_topic_score_gemma":0.001680529,"domain_scores_codex":[0.9958489,0.001697512,0.0001814593,0.0004422627,0.001237991,0.0005918984],"domain_scores_gemma":[0.9788759,0.01633113,0.001582363,0.001595452,0.001145046,0.0004701227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002159449,0.00004516202,0.001044334,0.00008797606,0.00003658392,0.0002187091,0.0002386174,0.2795712,0.002890956,0.7013575,0.0006396864,0.0136532],"study_design_scores_gemma":[0.00001579319,0.0000380328,0.0002013888,0.00001851479,0.00001187096,0.00006814956,0.00002643308,0.5998381,0.002497438,0.3961057,0.001142877,0.00003567074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05301827,0.0003200051,0.9395671,0.0002560729,0.00003145036,0.00007703515,0.0001924708,0.0002243464,0.006313374],"genre_scores_gemma":[0.8504888,0.0009484164,0.1442286,0.0001695533,0.0001547037,0.0002756051,0.0003797073,0.0001539393,0.003200655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0037334,"threshold_uncertainty_score":0.01974434,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008646976787450885,"score_gpt":0.2383433139510096,"score_spread":0.2296963371635587,"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."}}