{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005884248,0.0003394907,0.0003719651,0.0003765485,0.0003188772,0.000321671,0.0004394109,0.0003600956,0.0003738535],"category_scores_gemma":[0.001949497,0.0002533133,0.0002562924,0.0002681776,0.0004617308,0.0003223529,0.0005568667,0.0004048343,0.0001411112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002980588,"about_ca_system_score_gemma":0.0006296712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002779779,"about_ca_topic_score_gemma":0.0005620926,"domain_scores_codex":[0.9995673,0.0001651552,0.00002413869,0.0000587965,0.0001435537,0.00004088203],"domain_scores_gemma":[0.998908,0.0003789451,0.0002635622,0.0001778204,0.0002256326,0.00004600823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001838197,0.0001211203,0.003569351,0.0002787666,0.0001025838,0.0002018287,0.000206178,0.6818574,0.1080691,0.09713648,0.001155916,0.1071174],"study_design_scores_gemma":[0.00002837643,0.0001719494,0.0003887374,0.00002009948,0.00002103782,0.0001020429,0.00001398641,0.960971,0.02675105,0.009795617,0.001711485,0.00002453952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1187527,0.0002262778,0.8782061,0.0001056248,0.00003807677,0.00007537412,0.00005640449,0.0002258475,0.002313513],"genre_scores_gemma":[0.7119408,0.0001688765,0.2868999,0.00005601489,0.00001666881,0.000183125,0.00006296818,0.0000356528,0.0006360032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0005884248,"threshold_uncertainty_score":0.003111959,"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."}}