{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004810466,0.0001863221,0.0002201746,0.0001272772,0.00007176421,0.00004252104,0.002549576,0.0001538211,0.00001791934],"category_scores_gemma":[0.0001479534,0.0001242426,0.0001012425,0.0001717344,0.00009584636,0.00005828381,0.001477253,0.0004937322,0.0000179262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007199998,"about_ca_system_score_gemma":0.0002151637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002195625,"about_ca_topic_score_gemma":0.000006291516,"domain_scores_codex":[0.9986897,0.0002448069,0.000193477,0.0003972689,0.0003141268,0.0001606497],"domain_scores_gemma":[0.9973283,0.0009478048,0.0001964419,0.001374431,0.0001230623,0.00002998794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002869282,0.0001985414,0.00009409999,0.00005432482,0.0001002718,0.00005990443,0.003544593,0.02188163,0.001108352,0.8516723,0.1107475,0.01050982],"study_design_scores_gemma":[0.0001893611,0.0005513087,0.0002353622,0.0005656004,0.00002418087,0.0000478008,0.000111934,0.6157089,0.1467565,0.2339658,0.00091977,0.000923365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002447069,0.00002088871,0.9717746,0.0006829791,0.0003302036,0.0003445335,0.000001300565,0.0007349864,0.02366342],"genre_scores_gemma":[0.6834879,0.0001044799,0.3152318,0.0002903164,0.00002351964,0.0000172725,7.225554e-7,0.00001383727,0.0008302009],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6810408,"threshold_uncertainty_score":0.5066465,"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."}}