{"id":"W2169105083","doi":"10.1109/isit.2008.4595097","title":"On the design of universal LDPC codes","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Channel capacity; Channel code; Decoding methods; Coding (social sciences); Channel (broadcasting); Binary erasure channel; Computer science; Regular polygon; Mathematics; Algorithm; Theoretical computer science; Topology (electrical circuits); Combinatorics; Telecommunications; 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.001544251,0.0006771587,0.0007519464,0.0009320919,0.0006502043,0.0009257186,0.0007395599,0.0008009952,0.0009394291],"category_scores_gemma":[0.007583285,0.0005253276,0.0003018084,0.001111747,0.00137586,0.001184668,0.001392161,0.000876139,0.0003065366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009741051,"about_ca_system_score_gemma":0.001331349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001203342,"about_ca_topic_score_gemma":0.001411185,"domain_scores_codex":[0.9987803,0.0005784149,0.00006138641,0.0001851628,0.000288168,0.000106514],"domain_scores_gemma":[0.99701,0.001852777,0.0002708236,0.0003623012,0.0004260731,0.00007796574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001347142,0.00003172143,0.0008481225,0.000316472,0.0000404954,0.0001434211,0.0002442689,0.5214263,0.008429641,0.3433275,0.002249809,0.1228075],"study_design_scores_gemma":[0.00002385839,0.00004799969,0.0000897709,0.00006210811,0.00001385519,0.000107349,0.00002717448,0.8853623,0.004516768,0.1055209,0.004210824,0.0000171937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01582187,0.0009292078,0.9788454,0.0001977254,0.00003073741,0.00004640205,0.00006069887,0.0001865667,0.003881482],"genre_scores_gemma":[0.5577437,0.002379268,0.4350707,0.000226887,0.00009025176,0.0003052523,0.0001954882,0.0001042715,0.003884248],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001544251,"threshold_uncertainty_score":0.008166909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05647989877016862,"score_gpt":0.267241384367544,"score_spread":0.2107614855973753,"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."}}