{"id":"W2130092083","doi":"10.1109/tcomm.2009.07.070619","title":"Identical-capacity channel decomposition for design of universal LDPC codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Code (set theory); Channel (broadcasting); Conjecture; Computer science; Regular polygon; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Telecommunications; 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.001182111,0.0009954197,0.0006732383,0.0007282034,0.0005159284,0.0009210233,0.0006409275,0.0007132541,0.003330519],"category_scores_gemma":[0.003422724,0.0004398804,0.0005359376,0.0008403062,0.001047614,0.0009286299,0.001103302,0.001069398,0.0006213413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001373504,"about_ca_system_score_gemma":0.002140153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001709851,"about_ca_topic_score_gemma":0.001953065,"domain_scores_codex":[0.9990757,0.0003287898,0.00004261693,0.0001669767,0.000227376,0.0001585655],"domain_scores_gemma":[0.9987103,0.0005643099,0.0001289161,0.0002263569,0.0002708432,0.00009930364],"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.0003384583,0.00008559752,0.0005564084,0.0002969346,0.00004940143,0.0001231838,0.0001680217,0.7151192,0.01848365,0.1987614,0.004471436,0.06154637],"study_design_scores_gemma":[0.00002627885,0.00006618724,0.0001012004,0.00003074241,0.00001432634,0.00004856825,0.00002505696,0.9480444,0.005301743,0.04407757,0.002243672,0.00002023767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02267948,0.000306858,0.969177,0.0001784065,0.00003854972,0.00009965128,0.0002025577,0.000298012,0.007019455],"genre_scores_gemma":[0.7159848,0.0006079442,0.2774304,0.0003029669,0.00008258249,0.0004332456,0.0005581198,0.0001234056,0.004476388],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003330519,"threshold_uncertainty_score":0.01114172,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07968733975742756,"score_gpt":0.3290297916985942,"score_spread":0.2493424519411666,"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."}}