{"id":"W2170470734","doi":"10.1109/lcomm.2008.080977","title":"Robust LDPC decoding using irregular decoders","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Robustness (evolution); Computer science; Algorithm; Channel code; Channel (broadcasting); Error detection and correction; Minification; Forward error correction; Parity bit; Convergence (economics); Code (set theory); Telecommunications","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.0003724385,0.0001865665,0.0001847987,0.000280393,0.0009505156,0.0001012784,0.004318743,0.00006905651,0.000003963653],"category_scores_gemma":[0.00007298895,0.0002163679,0.0001117726,0.0006966193,0.0002720031,0.0006996767,0.0006822501,0.0003633844,0.0000358849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000213165,"about_ca_system_score_gemma":0.00007895364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001686728,"about_ca_topic_score_gemma":0.00005142043,"domain_scores_codex":[0.9984775,0.0002321584,0.0003351544,0.000354076,0.0002469631,0.0003541651],"domain_scores_gemma":[0.9953223,0.0002883221,0.0001727976,0.004028869,0.00009786883,0.00008982027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001772759,0.0008445613,0.04359532,0.00007563468,0.0003262231,0.0002343579,0.0211077,0.05935997,0.702398,0.01930339,0.1070662,0.04567086],"study_design_scores_gemma":[0.0004275694,0.00003756441,0.00201653,0.000159955,0.00002663642,0.0007879329,0.000108057,0.9594716,0.02753915,0.0006894876,0.00770438,0.001031141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1722699,0.0001902759,0.8197433,0.005725012,0.0003240894,0.0001644874,8.003454e-7,0.0009131433,0.0006689869],"genre_scores_gemma":[0.4912793,0.00007164678,0.5069141,0.001654162,0.00002484703,0.00001864218,0.000001813418,0.00001716703,0.0000182876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9001116,"threshold_uncertainty_score":0.8823228,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1719205382265378,"score_gpt":0.3057297130795647,"score_spread":0.1338091748530269,"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."}}