{"id":"W2049608049","doi":"10.1109/tit.2006.887467","title":"On Designing Good LDPC Codes for Markov Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Low-density parity-check code; Markov chain; Decoding methods; Computer science; Schedule; Channel (broadcasting); Algorithm; Block (permutation group theory); Markov process; Code (set theory); Message passing; Theoretical computer science; Mathematics; Parallel computing; Telecommunications; Combinatorics; Set (abstract data type); 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.002095659,0.0001761469,0.0001384392,0.0005288974,0.0003778965,0.0001541829,0.0004867803,0.000116108,0.0000204194],"category_scores_gemma":[0.00004773069,0.0001737961,0.000119294,0.0003639377,0.00003661537,0.00158439,0.000002472847,0.0002402099,0.0001008234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001275623,"about_ca_system_score_gemma":0.00004424448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004780616,"about_ca_topic_score_gemma":0.00000393346,"domain_scores_codex":[0.9987709,0.00006931661,0.0004021517,0.000171652,0.0002664617,0.0003195406],"domain_scores_gemma":[0.9979697,0.001205464,0.0001663599,0.0004241692,0.0001532032,0.00008112426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000390687,0.0001522258,0.000001582333,0.0000657705,0.00005033409,0.000001451156,0.006246035,0.01292773,0.001002457,0.2605243,0.0009535474,0.7176839],"study_design_scores_gemma":[0.001060859,0.00111133,0.00002829019,0.0002017046,0.00002792555,0.00003789762,0.0007186323,0.06308511,0.843153,0.08701486,0.002878113,0.0006822786],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001247016,0.000003767578,0.9889797,0.0001083311,0.001308067,0.0005109241,0.00001009776,0.00104445,0.00678766],"genre_scores_gemma":[0.9104233,0.000003519378,0.08809324,0.00102092,0.00003148535,0.0001176708,0.000002981845,0.0000129079,0.0002939909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9091763,"threshold_uncertainty_score":0.7087199,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01377970465499197,"score_gpt":0.2608090091921903,"score_spread":0.2470293045371983,"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."}}