{"id":"W2554211814","doi":"10.1109/allerton.2009.5394793","title":"On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Puncturing; Binary erasure channel; Decoding methods; Maximization; Mathematics; Algorithm; Binary number; Channel (broadcasting); Channel capacity; Computer science; Topology (electrical circuits); Mathematical optimization; Arithmetic; Combinatorics","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.001214666,0.0006305265,0.0003887454,0.000403509,0.0003238447,0.0004563592,0.0005952141,0.0004822483,0.0006682953],"category_scores_gemma":[0.003062467,0.0003535955,0.0003218699,0.0003924754,0.0008145735,0.0006610712,0.000867673,0.0007313545,0.000241256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000446422,"about_ca_system_score_gemma":0.0008699504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003438131,"about_ca_topic_score_gemma":0.0004534169,"domain_scores_codex":[0.9991054,0.0003569784,0.0000631049,0.000127079,0.0002578583,0.00008957697],"domain_scores_gemma":[0.998412,0.000811599,0.0002679073,0.0002060727,0.0002231093,0.00007925991],"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.000195082,0.00009866635,0.001247731,0.0002593557,0.00004517141,0.0002792364,0.0003479308,0.5304278,0.1169425,0.2656577,0.00080825,0.0836906],"study_design_scores_gemma":[0.00002841066,0.0002612528,0.0001920105,0.00003637596,0.00001116263,0.000139097,0.00002279095,0.9013017,0.06238659,0.03343642,0.002150783,0.0000334059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08082455,0.0002625848,0.913359,0.0001282808,0.00002515023,0.00009820295,0.00005779499,0.0002584361,0.004986057],"genre_scores_gemma":[0.7411648,0.0003771792,0.2566463,0.0001277934,0.00002572118,0.0001929545,0.00009737066,0.00006165091,0.001306256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001214666,"threshold_uncertainty_score":0.006423831,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06156967862486773,"score_gpt":0.2653749626163955,"score_spread":0.2038052839915278,"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."}}