{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108554,0.000645147,0.0006025485,0.0007964066,0.0004497463,0.001090234,0.0003613344,0.0003806458,0.001776865],"category_scores_gemma":[0.004165575,0.0002185838,0.0002133437,0.001076076,0.001196325,0.001264211,0.0006977285,0.0005407304,0.0002578306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007903565,"about_ca_system_score_gemma":0.00159238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231235,"about_ca_topic_score_gemma":0.00214562,"domain_scores_codex":[0.9988542,0.000407734,0.00004549922,0.00007571977,0.000362001,0.000254889],"domain_scores_gemma":[0.9956967,0.002337472,0.000499449,0.0006418276,0.0005913662,0.0002332585],"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.0008123182,0.00007266233,0.001712534,0.0001680058,0.00002589168,0.0002920598,0.0001804644,0.506776,0.02599169,0.4107455,0.001612582,0.05161026],"study_design_scores_gemma":[0.00004506788,0.0001660045,0.0006896918,0.00003297865,0.00001535728,0.0001276755,0.00004171717,0.8386773,0.01572651,0.1427192,0.001719331,0.00003915386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3750654,0.0006607219,0.605355,0.0003463645,0.0000702297,0.0001043434,0.000643698,0.0007277493,0.01702646],"genre_scores_gemma":[0.9423312,0.0007338633,0.05339746,0.00009132698,0.00006965656,0.00007196468,0.0005907869,0.0001160779,0.002597663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002231235,"threshold_uncertainty_score":0.005944252,"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."}}