{"id":"W220014954","doi":"10.1109/tit.2019.2942615","title":"On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"European Commission","keywords":"Decoding methods; Decodes; Encoder; Computer science; Coding (social sciences); Encoding (memory); Channel (broadcasting); Upper and lower bounds; Dirty paper coding; Algorithm; Computer network; Theoretical computer science; Precoding; Mathematics; MIMO; Artificial intelligence","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.002012864,0.0007880917,0.0009734551,0.0007671162,0.000576153,0.00147204,0.000776888,0.001056787,0.001524227],"category_scores_gemma":[0.006510808,0.0003383542,0.0004564904,0.001331615,0.002081507,0.002298203,0.00148211,0.001562337,0.0004352205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001779088,"about_ca_system_score_gemma":0.001526325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003076475,"about_ca_topic_score_gemma":0.001428742,"domain_scores_codex":[0.9984181,0.0006591136,0.00004821784,0.0001517703,0.0005138314,0.0002090078],"domain_scores_gemma":[0.9940774,0.004619757,0.0003639708,0.0003892556,0.0004732068,0.00007638897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002548025,0.00003238959,0.0004293967,0.0001896971,0.00003059865,0.000342655,0.0002197701,0.353515,0.004167096,0.6118708,0.001961742,0.02698608],"study_design_scores_gemma":[0.00001785984,0.00004577906,0.0001350775,0.00002755797,0.00001198774,0.0001531403,0.00003601745,0.8463831,0.00319288,0.1479944,0.001975893,0.00002620437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03729075,0.001149889,0.9482685,0.000671368,0.00005029433,0.00005224927,0.000186785,0.00009347855,0.01223674],"genre_scores_gemma":[0.8348975,0.002960843,0.1528931,0.0002735743,0.0001998262,0.0002035024,0.0003704889,0.00006846849,0.008132735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003076475,"threshold_uncertainty_score":0.01290828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02810047614797787,"score_gpt":0.2340389823542498,"score_spread":0.2059385062062719,"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."}}