{"id":"W3101931308","doi":"","title":"Disjoint LDPC Coding for Gaussian Broadcast Channels","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Coding (social sciences); Algorithm; Channel code; Joint (building); Theoretical computer science; Gaussian; Channel capacity; Channel (broadcasting); Dirty paper coding; Computer network; Mathematics; MIMO; Precoding; Statistics; Engineering","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.0009337264,0.0004503439,0.0004900157,0.000256136,0.000173441,0.000481088,0.002328124,0.0003787917,0.00003296731],"category_scores_gemma":[0.000137702,0.0004138966,0.0003190611,0.0001747056,0.00004154521,0.0003559736,0.003730412,0.0006371874,0.00005252564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001927884,"about_ca_system_score_gemma":0.0001261806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000149726,"about_ca_topic_score_gemma":0.00001834965,"domain_scores_codex":[0.9974232,0.00007152776,0.0004701242,0.0009680958,0.0003261323,0.0007408929],"domain_scores_gemma":[0.9973972,0.0001981387,0.0003333164,0.001696467,0.0001606887,0.0002142235],"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.00002851017,0.0004774341,0.0007164829,0.001495403,0.0002159215,0.00002296721,0.01032295,0.0004665015,0.002781053,0.5860399,0.05764109,0.3397918],"study_design_scores_gemma":[0.0009922395,0.0004638355,0.0007781974,0.002579348,0.00016802,0.0002102797,0.0002767613,0.5505173,0.1483001,0.1976701,0.09220731,0.005836449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003983165,0.0001968465,0.9729573,0.00142512,0.00543572,0.001088771,0.00000974733,0.002724423,0.01576373],"genre_scores_gemma":[0.6157728,0.00002304827,0.3810805,0.0002840865,0.0006557953,0.0003957939,0.00001458541,0.00004746295,0.001725902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6153744,"threshold_uncertainty_score":0.9998313,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06167308574925578,"score_gpt":0.3147242386593206,"score_spread":0.2530511529100649,"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."}}