{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998644,0.0001322957,0.0001786797,0.0002503925,0.0004406727,0.00004924133,0.00162279,0.00008635843,0.000003213646],"category_scores_gemma":[0.00001815505,0.0001503614,0.0001327167,0.0004518507,0.0001160084,0.0004130793,0.000007232811,0.0002331258,0.000006897212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001037873,"about_ca_system_score_gemma":0.00005734322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003419461,"about_ca_topic_score_gemma":0.00003474694,"domain_scores_codex":[0.9989133,0.0002049822,0.0003175379,0.0002234987,0.0001574242,0.000183254],"domain_scores_gemma":[0.9971154,0.0007435194,0.0001370226,0.001696001,0.0002444471,0.00006358323],"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.0003869137,0.009805002,0.00001359023,0.0001146118,0.0004176952,0.00000332726,0.01107042,0.08548989,0.2775871,0.4024459,0.003139965,0.2095255],"study_design_scores_gemma":[0.0005716709,0.0009338827,0.0001467087,0.0001385693,0.00007993504,0.00002024886,0.00007622254,0.7090339,0.2260309,0.06239057,0.0002170271,0.0003603283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000577044,0.00002693718,0.9956201,0.002198839,0.0001495544,0.0005005309,0.00002005078,0.0004937594,0.0004132314],"genre_scores_gemma":[0.6153424,0.00006365977,0.3844149,0.0000909062,0.000004509951,0.00004585459,0.000002015607,0.000006040702,0.00002968624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.623544,"threshold_uncertainty_score":0.6131558,"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."}}