{"id":"W2148926081","doi":"10.1109/isit.2003.1228310","title":"On partial ordering of markov modulated channels under ldpc decoding","year":2003,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Decoding methods; Computer science; Markov process; Metric (unit); Channel (broadcasting); Binary number; Algorithm; Markov model; Low-density parity-check code; Code (set theory); Theoretical computer science; Topology (electrical circuits); Mathematics; Computer network; Combinatorics; Arithmetic; Engineering; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003517888,0.0001186055,0.0001447064,0.0001272948,0.00006227608,0.00004420272,0.0003898279,0.00005924956,0.00005507777],"category_scores_gemma":[0.0001427958,0.0001101775,0.00004401357,0.0004269288,0.00001810825,0.000183481,0.00009965985,0.0001075253,0.0000129111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003632361,"about_ca_system_score_gemma":0.00003651646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003294686,"about_ca_topic_score_gemma":0.00001019295,"domain_scores_codex":[0.9989817,0.00007083505,0.0002152376,0.0002940423,0.000190771,0.000247391],"domain_scores_gemma":[0.9992264,0.0001289794,0.00007635939,0.0004504257,0.00006572252,0.00005210742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003020726,0.0003389271,0.001366331,0.00006026317,0.00008262369,0.00003208209,0.001556963,0.0230148,0.07054655,0.8564596,0.003799498,0.04271221],"study_design_scores_gemma":[0.0002709042,0.000201017,0.0001961899,0.00008097534,0.000004506951,0.00001983294,0.00003243401,0.3156693,0.6524597,0.03035619,0.000378954,0.0003299522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2117643,0.000009686542,0.771641,0.00009402775,0.0004444033,0.00009810579,1.444462e-7,0.000550473,0.0153979],"genre_scores_gemma":[0.9187098,0.000002061455,0.08074627,0.0001605511,0.0000112211,0.000005616581,2.206101e-7,0.00001040296,0.0003538867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8261033,"threshold_uncertainty_score":0.4492907,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0255363848617571,"score_gpt":0.2698239063826605,"score_spread":0.2442875215209034,"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."}}