{"id":"W2169212840","doi":"10.1109/isit.2008.4595096","title":"New sequences of capacity achieving LDPC code ensembles over the binary erasure channel","year":2008,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Binary erasure channel; Binary number; Combinatorics; Code (set theory); Algorithm; Discrete mathematics; Set (abstract data type); Computer science; Channel (broadcasting); Mathematics; Channel capacity; Arithmetic; Programming language","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.0005029464,0.0001597054,0.0001942485,0.00008588238,0.0002902828,0.00003798507,0.001288656,0.0000756299,0.00002174495],"category_scores_gemma":[0.0001048242,0.0001056512,0.00009337662,0.0004187813,0.0001178796,0.0004236284,0.0003125113,0.0002659629,0.000009389252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003363152,"about_ca_system_score_gemma":0.0001380622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001127104,"about_ca_topic_score_gemma":0.0002100157,"domain_scores_codex":[0.9986844,0.0001471183,0.0002190259,0.0003222568,0.0003695867,0.0002575782],"domain_scores_gemma":[0.9986984,0.0002995661,0.0001469479,0.000696948,0.00008976962,0.00006835652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005317711,0.0004354016,0.06402179,0.0002012819,0.0001935249,0.0002286613,0.05997601,0.002180089,0.5243167,0.08315644,0.2200524,0.04518458],"study_design_scores_gemma":[0.0006706144,0.0009893773,0.1242245,0.00045595,0.0000390891,0.001079666,0.0006058962,0.06291831,0.7809451,0.02073281,0.005784044,0.001554588],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6276616,0.0002637068,0.3665469,0.001792309,0.0002848871,0.0001538894,0.000001451749,0.0006592368,0.00263609],"genre_scores_gemma":[0.9205348,0.00005002641,0.078412,0.000326869,0.00006227643,0.000005529319,2.570179e-7,0.000009149417,0.000599038],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2928733,"threshold_uncertainty_score":0.4308332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.054964552912988,"score_gpt":0.2633269201887086,"score_spread":0.2083623672757206,"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."}}