Facet browsing currently unavailable
Page 4 of 16683 results
Sort by: relevance publication year
Low-complexity coding scheme to approach multiple-access channel capacity PROCEEDINGS ARTICLE published June 2015 in 2015 IEEE International Symposium on Information Theory (ISIT) |
On the Sum-Capacity of Degraded Gaussian Multiple-Access Relay Channels JOURNAL ARTICLE published December 2009 in IEEE Transactions on Information Theory |
On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and Broadcast Channels JOURNAL ARTICLE published November 2009 in IEEE Transactions on Information Theory |
Dependence balance in multiple access channels with correlated sources PROCEEDINGS ARTICLE published June 2017 in 2017 IEEE International Symposium on Information Theory (ISIT) |
Distributed rate splitting in Gaussian and discrete memoryless multiple-access channels PROCEEDINGS ARTICLE published 2005 in Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. |
Secure signaling games for Gaussian multiple access wiretap channels PROCEEDINGS ARTICLE published June 2015 in 2015 IEEE International Symposium on Information Theory (ISIT) |
Multiple Access Channels with Adversarial Users PROCEEDINGS ARTICLE published July 2019 in 2019 IEEE International Symposium on Information Theory (ISIT) |
Upper bound for the capacity of multiple access protocols on multipacket reception channels PROCEEDINGS ARTICLE published July 2012 in 2012 IEEE International Symposium on Information Theory Proceedings |
Contributions to Successive Decoding for Multiple Access Channels PROCEEDINGS ARTICLE published October 2018 in 2018 International Symposium on Information Theory and Its Applications (ISITA) |
On the Sum-Rate Capacity of Poisson MISO Multiple Access Channels JOURNAL ARTICLE published October 2017 in IEEE Transactions on Information Theory Research funded by National Science Foundation (CCF-13-18980,CCF-16-65073) | National Science Foundation (CCF-12-18451,CCF-16-18127) | European Union’s Horizon 2020 Research and Innovation Programme (694630) |
On the Optimality of Treating Interference as Noise for Interfering Multiple Access Channels PROCEEDINGS ARTICLE published June 2018 in 2018 IEEE International Symposium on Information Theory (ISIT) |
Constant-gap sum-capacity approximation of the deterministic interfering multiple access channel PROCEEDINGS ARTICLE published June 2015 in 2015 IEEE International Symposium on Information Theory (ISIT) |
Monotonicity results for coherent single-user and multiple-access MIMO Rician channels PROCEEDINGS ARTICLE published 2005 in Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. |
On the structure of the capacity region of the gaussian multiple access channel PROCEEDINGS ARTICLE published in International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. |
On the Capacity of Memoryless Finite-State Multiple-Access Channels With Asymmetric State Information at the Encoders JOURNAL ARTICLE published March 2011 in IEEE Transactions on Information Theory |
Distribution Decomposition and Sum-Capacity Results of Two-User Optical Intensity Multiple Access Channels JOURNAL ARTICLE published September 2023 in IEEE Transactions on Information Theory Research funded by National Natural Science Foundation of China (62071489) | Shanghai Sailing Program (21YF1411000) |
Joint State Sensing and Communication over Memoryless Multiple Access Channels PROCEEDINGS ARTICLE published July 2019 in 2019 IEEE International Symposium on Information Theory (ISIT) |
Helper-assisted state cancelation for multiple access channels PROCEEDINGS ARTICLE published July 2016 in 2016 IEEE International Symposium on Information Theory (ISIT) |
A Functional Construction of Codes for Multiple Access and Broadcast Channels PROCEEDINGS ARTICLE published June 2020 in 2020 IEEE International Symposium on Information Theory (ISIT) |
Individual Outage Rate Regions for Fading Multiple Access Channels PROCEEDINGS ARTICLE published June 2007 in 2007 IEEE International Symposium on Information Theory |