{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002595394,0.0003290804,0.0008356137,0.0009590298,0.0001390628,0.00008814764,0.001601877,0.0001331763,0.000004453198],"category_scores_gemma":[0.0004200455,0.000274949,0.0001471258,0.001568084,0.00008200195,0.0005929802,0.0001432138,0.0002779393,0.000005736576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001476894,"about_ca_system_score_gemma":0.0001308116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002717672,"about_ca_topic_score_gemma":0.00001501598,"domain_scores_codex":[0.9967237,0.000999033,0.0006792853,0.0005737864,0.0006414272,0.0003828298],"domain_scores_gemma":[0.9965246,0.00143878,0.0007323356,0.000941026,0.0002645732,0.00009872153],"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.0002237007,0.002413084,0.000814193,0.01393331,0.0003296382,0.000120845,0.02012073,0.2230362,0.2771231,0.4552364,0.002185233,0.004463526],"study_design_scores_gemma":[0.0004188078,0.00156679,0.0005256828,0.002928658,0.00004940972,0.00002225799,0.0003246729,0.5497425,0.4350533,0.00886977,7.935133e-7,0.0004973094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3034571,0.00007483374,0.6938713,0.0001048751,0.0001870222,0.0007150677,0.000002144556,0.0004352063,0.001152452],"genre_scores_gemma":[0.9184536,0.000007249371,0.08124483,0.00009888019,0.00001286308,0.00001116119,7.871842e-7,0.00001427572,0.0001563243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6149966,"threshold_uncertainty_score":0.9999703,"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."}}