{"id":"W2113120847","doi":"10.1109/tcomm.2010.01.070451","title":"Systematic design of low-density parity-check code ensembles for binary erasure channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Erasure; Binary erasure channel; Low-density parity-check code; Binary number; Algorithm; Node (physics); Upper and lower bounds; Mathematics; Code (set theory); Degree (music); Computer science; Theoretical computer science; Topology (electrical circuits); Decoding methods; Channel capacity; Arithmetic; Combinatorics; Coding (social sciences); 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.001127546,0.0002032328,0.0003812741,0.0002708807,0.0006334799,0.00008024223,0.002617584,0.0001750962,0.000004277165],"category_scores_gemma":[0.0001054313,0.0002069243,0.0001912977,0.000510557,0.0001619603,0.0003154119,0.00002297282,0.0006043259,0.00001534927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004734863,"about_ca_system_score_gemma":0.0001307357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006246008,"about_ca_topic_score_gemma":0.0003181591,"domain_scores_codex":[0.9982767,0.0003850745,0.0005493159,0.000312481,0.0002353498,0.0002410389],"domain_scores_gemma":[0.9931817,0.002167154,0.0002756022,0.003843482,0.0004460923,0.0000859697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001882771,0.007752281,0.00006085191,0.01153391,0.0008832367,0.000006925441,0.01572233,0.03357548,0.8632299,0.05394954,0.00323647,0.009860806],"study_design_scores_gemma":[0.0004968088,0.000412955,0.00005022642,0.002004051,0.0001522999,0.00005689874,0.0001804457,0.6073163,0.3814562,0.007226636,0.00009962171,0.0005475975],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003573268,0.00007000455,0.9923399,0.001111721,0.0007163433,0.001406296,0.00002521487,0.0006558073,0.0001014422],"genre_scores_gemma":[0.7380425,0.00006016885,0.2611682,0.00005990848,0.000009979944,0.0005257881,0.000002134429,0.00001981278,0.0001114737],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7344692,"threshold_uncertainty_score":0.8438127,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05596313526142133,"score_gpt":0.304053535891216,"score_spread":0.2480904006297947,"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."}}