{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006034958,0.0003105688,0.0002426363,0.0004001987,0.0002845346,0.0003288318,0.000424055,0.0002737519,0.00006384551],"category_scores_gemma":[0.00002691311,0.0002798652,0.00009907227,0.0001188288,0.00009650867,0.0007158622,0.00001759137,0.001276901,0.0001368943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000225922,"about_ca_system_score_gemma":0.00002312022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001534577,"about_ca_topic_score_gemma":0.000009970091,"domain_scores_codex":[0.9987997,0.0001564019,0.0004944965,0.0001502095,0.0002061677,0.0001929536],"domain_scores_gemma":[0.9981071,0.0008149815,0.0001608628,0.0007649779,0.00009978234,0.00005231253],"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.0002409992,0.00009955264,0.000005542551,0.001004686,0.0002851328,5.761554e-7,0.01939585,0.8260026,0.0009065477,0.04363424,0.001424341,0.1069999],"study_design_scores_gemma":[0.0004344428,0.00007706432,0.00005716119,0.001343057,0.00004982977,0.00001431541,0.00165043,0.9483756,0.02711317,0.0193162,0.0009200491,0.0006486878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04186114,0.00006093032,0.9516952,0.0001181947,0.0009601839,0.0007328829,0.0001201671,0.0008395538,0.003611764],"genre_scores_gemma":[0.9981577,0.0007971027,0.000446132,0.0002211503,0.00001784722,0.0002534864,0.00003521083,0.00003427301,0.00003713604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9562965,"threshold_uncertainty_score":0.9999654,"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."}}