{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345173,0.0004345855,0.0003279471,0.0006372478,0.000578806,0.0005316726,0.0005680353,0.0005538712,0.001596826],"category_scores_gemma":[0.003258222,0.0002234451,0.0001758079,0.000768085,0.0007579113,0.0003816974,0.0008329941,0.0005946567,0.000377477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008629391,"about_ca_system_score_gemma":0.0009604307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002407352,"about_ca_topic_score_gemma":0.001892387,"domain_scores_codex":[0.9993267,0.000242658,0.00002212712,0.00007098245,0.0002605732,0.00007699577],"domain_scores_gemma":[0.9984458,0.0008668571,0.0001517212,0.0002101421,0.0002843192,0.00004112269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005081103,0.0001264736,0.001018971,0.0002332429,0.00003888358,0.0004993224,0.0003510178,0.4909485,0.03569917,0.3414762,0.004332613,0.1247676],"study_design_scores_gemma":[0.000057479,0.00005275837,0.0002241892,0.00003566635,0.00001691497,0.0001710934,0.00002293292,0.895947,0.01678374,0.08227532,0.004392477,0.00002044376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09203044,0.0005767403,0.8931738,0.0004036109,0.0000530535,0.00006547099,0.0002779921,0.0004637223,0.01295508],"genre_scores_gemma":[0.8301834,0.0004790861,0.1646824,0.0001156192,0.00004286785,0.0001778257,0.0003360593,0.00004641308,0.003936277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002407352,"threshold_uncertainty_score":0.00626111,"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."}}