{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001769643,0.0007637299,0.0008593447,0.0007314818,0.0003019391,0.0009006878,0.0005903181,0.0007827582,0.0006826196],"category_scores_gemma":[0.007562807,0.0003460996,0.0004221659,0.0007996339,0.0008632705,0.001045338,0.001510227,0.0008318234,0.0004296213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005591342,"about_ca_system_score_gemma":0.0007095102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00073189,"about_ca_topic_score_gemma":0.0005903994,"domain_scores_codex":[0.9982743,0.0006119558,0.0001426053,0.0002822522,0.0005629506,0.0001258948],"domain_scores_gemma":[0.9964212,0.001745593,0.0005014773,0.0007724955,0.0004610411,0.00009826865],"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.000273086,0.00003171723,0.0007227064,0.00007144045,0.00005634174,0.000112524,0.00008387308,0.871168,0.03023048,0.03780514,0.0004420435,0.05900274],"study_design_scores_gemma":[0.00001177297,0.00003468561,0.00009892571,0.000005938351,0.0000066733,0.00004690587,0.000004661265,0.9772828,0.01307381,0.008768112,0.0006524939,0.00001312684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02590903,0.0001071271,0.9720149,0.00008395312,0.00001346395,0.00002040833,0.0000492883,0.0003884408,0.001413474],"genre_scores_gemma":[0.6332759,0.0002292334,0.3638748,0.00006757109,0.00004504176,0.00007672479,0.0002372964,0.0001575394,0.002035849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001769643,"threshold_uncertainty_score":0.009358883,"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."}}