{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000568256,0.0005591356,0.0003869293,0.0005457503,0.0004566157,0.0005178272,0.0005441881,0.0005484743,0.001247008],"category_scores_gemma":[0.003246517,0.0001981149,0.0002555933,0.000446908,0.0005720101,0.0009648289,0.0007626252,0.0009404531,0.000407177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003915999,"about_ca_system_score_gemma":0.0005891414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003353799,"about_ca_topic_score_gemma":0.0006388479,"domain_scores_codex":[0.9993869,0.0001867018,0.00004765141,0.00008384517,0.0002272758,0.00006753636],"domain_scores_gemma":[0.9984281,0.0004763671,0.0001950583,0.0002418059,0.0005194836,0.0001391817],"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.0007432376,0.0001778529,0.002447433,0.0003777929,0.00007900466,0.0006952625,0.0004946822,0.2191091,0.1177453,0.5305423,0.003596671,0.1239914],"study_design_scores_gemma":[0.0000711075,0.000544887,0.001403564,0.000130579,0.00004733872,0.001176031,0.0001047567,0.7759418,0.07062488,0.130821,0.01902165,0.0001124145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3126737,0.001647889,0.6650284,0.0005623393,0.0003700621,0.0001421233,0.0003984587,0.0005424571,0.01863457],"genre_scores_gemma":[0.799387,0.001009222,0.1911667,0.0003308418,0.0001892541,0.000197446,0.000625981,0.0001105631,0.00698296],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001247008,"threshold_uncertainty_score":0.004171669,"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."}}