{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006919592,0.0001048454,0.00008158696,0.0001620453,0.0000787127,0.0001659631,0.0005328277,0.00004558737,0.00001769621],"category_scores_gemma":[0.0001286255,0.0001005755,0.00002804593,0.0003892743,0.00001454447,0.001511809,0.0002307917,0.000123507,0.0001242538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004464496,"about_ca_system_score_gemma":0.00001928918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009139408,"about_ca_topic_score_gemma":0.00002484764,"domain_scores_codex":[0.9990745,0.00001457799,0.0002525653,0.0001465038,0.0002140343,0.0002978504],"domain_scores_gemma":[0.9992993,0.0001586752,0.00008212147,0.0003102007,0.00008198443,0.00006764609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001688798,0.00004677642,0.0005493594,0.0000283299,0.00001229173,0.00002008675,0.00624314,0.0002761273,0.001699731,0.005384672,0.04338202,0.9423406],"study_design_scores_gemma":[0.0006136075,0.0003843555,0.0005840755,0.00007048783,0.000004384856,0.00008303836,0.0003231507,0.5355878,0.2814052,0.004966953,0.1748501,0.001126848],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01338631,0.000009817552,0.9635992,0.0002078205,0.0004368872,0.0001121218,7.049824e-7,0.001332237,0.02091489],"genre_scores_gemma":[0.8525767,0.000005525852,0.1453906,0.0008751869,0.00002620109,0.000006576453,0.000004241258,0.000006629266,0.00110833],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9412137,"threshold_uncertainty_score":0.4101349,"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."}}