{"id":"W3006937682","doi":"10.1109/tit.2020.2975162","title":"Sliding-Window Superposition Coding: Two-User Interference Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Single antenna interference cancellation; Coding (social sciences); Computer science; Dirty paper coding; Algorithm; Encoder; Channel (broadcasting); Interference (communication); Superposition principle; Mathematics; Theoretical computer science; Telecommunications; MIMO; Precoding; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.0003488228,0.0001652948,0.0001414426,0.0001745786,0.0004235959,0.000340151,0.0007505997,0.00005636959,0.0002152185],"category_scores_gemma":[0.00002038848,0.0001630379,0.00008881489,0.0005500494,0.00003800912,0.002871979,0.00001244802,0.0003287195,0.0006614798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006570506,"about_ca_system_score_gemma":0.00004824974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001158749,"about_ca_topic_score_gemma":0.000001243069,"domain_scores_codex":[0.9988565,0.0002058754,0.000367476,0.0001701504,0.0002049078,0.0001950521],"domain_scores_gemma":[0.9989787,0.0001801307,0.000103541,0.0004190162,0.0001759455,0.0001426763],"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.0001549507,0.00009746834,0.00000484102,0.00003654188,0.00006568104,0.000001404295,0.02397139,0.03682112,0.003719886,0.6625412,0.0009012099,0.2716843],"study_design_scores_gemma":[0.002617242,0.0006506096,0.00006633236,0.0002286334,0.00003705608,0.00003311612,0.001184763,0.8085985,0.1661677,0.003955067,0.0154631,0.000997873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001421937,0.00002007084,0.9908966,0.002873388,0.0005871809,0.0002358561,0.000007216706,0.0003913299,0.003566393],"genre_scores_gemma":[0.9924332,0.0001320305,0.002098044,0.005120012,0.00004479257,0.0000568923,0.00000740849,0.00000715028,0.0001004269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9910113,"threshold_uncertainty_score":0.8502204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03212389064269327,"score_gpt":0.2548928782459537,"score_spread":0.2227689876032605,"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."}}