{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007631228,0.0006747895,0.0006270258,0.0003927656,0.0004360084,0.0005985316,0.0008664465,0.0006048621,0.001397776],"category_scores_gemma":[0.001539794,0.0002592521,0.0004293322,0.0009327706,0.001066939,0.0008955491,0.001074584,0.0009826884,0.0003582556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006080861,"about_ca_system_score_gemma":0.0009454691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001266779,"about_ca_topic_score_gemma":0.001203132,"domain_scores_codex":[0.9994929,0.0001474082,0.00002057207,0.00006309338,0.0002080051,0.00006796986],"domain_scores_gemma":[0.9993047,0.0003200764,0.00009344516,0.0001239611,0.00012114,0.00003676646],"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.0003842726,0.0001416405,0.0009221834,0.0002033836,0.00005816562,0.0004856303,0.0003409853,0.4088352,0.06731639,0.3826055,0.002051097,0.1366556],"study_design_scores_gemma":[0.00001520997,0.00005365967,0.00009385987,0.000008449249,0.000008767214,0.00009966987,0.000008481639,0.980832,0.008635997,0.00904773,0.001180676,0.00001546532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01557876,0.0002232789,0.9809384,0.00008981915,0.00003513,0.00004019076,0.00003015789,0.0001551359,0.002909008],"genre_scores_gemma":[0.7586759,0.0006127962,0.2372118,0.0001018969,0.00006642794,0.0001491325,0.00009516052,0.00003385722,0.003052985],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001397776,"threshold_uncertainty_score":0.004676044,"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."}}