{"id":"W2163750149","doi":"10.1109/tit.2005.856934","title":"Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Decoding methods; List decoding; Algorithm; Sequential decoding; Channel (broadcasting); Computer science; Concatenated error correction code; Theoretical computer science; Mathematics; Telecommunications; Block code","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.0009657991,0.000626079,0.0005376291,0.001295175,0.0005068461,0.0009373428,0.0007493186,0.0008795672,0.001365393],"category_scores_gemma":[0.006685975,0.0003111493,0.0004861768,0.0007743053,0.001531052,0.001128062,0.000702219,0.0009722841,0.0002513473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001605391,"about_ca_system_score_gemma":0.001349748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004556592,"about_ca_topic_score_gemma":0.002568242,"domain_scores_codex":[0.9995939,0.000133106,0.00001113257,0.00003063168,0.0001694849,0.00006185818],"domain_scores_gemma":[0.9968214,0.002337433,0.0002355677,0.0001255079,0.0004230606,0.00005709499],"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.00005889255,0.00001746704,0.0008926417,0.00007581653,0.00002143939,0.0001996298,0.0001509554,0.7547358,0.004277037,0.2335665,0.0005675185,0.005436271],"study_design_scores_gemma":[0.000002431782,0.000007151501,0.0001568759,0.000009499369,0.000003430398,0.00003370447,0.00001035467,0.9644554,0.0009127512,0.0342052,0.000194107,0.000009152128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2333541,0.001473413,0.746804,0.0009012243,0.00005011968,0.00007562601,0.0002322717,0.0002072758,0.01690195],"genre_scores_gemma":[0.9711051,0.001035238,0.0237026,0.0001030282,0.00004472357,0.00008213484,0.0001560025,0.0000651119,0.003705993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004556592,"threshold_uncertainty_score":0.011648,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01269385825656941,"score_gpt":0.252619449542173,"score_spread":0.2399255912856036,"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."}}