Facet browsing currently unavailable
Page 1 of 198266 results
Sort by: relevance publication year
Generalized time sharing: a low-complexity capacity-achieving multiple-access technique JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
Generalized time sharing for multiple access channels PROCEEDINGS ARTICLE published in Proceedings of IEEE International Symposium on Information Theory |
Rate-splitting multiple access for discrete memoryless channels JOURNAL ARTICLE published March 2001 in IEEE Transactions on Information Theory |
The capacity of the quantum multiple-access channel JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
On the optimality of generalized time-sharing for M-ary multiple-access channels PROCEEDINGS ARTICLE published in 1998 Information Theory Workshop (Cat. No.98EX131) |
On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels JOURNAL ARTICLE published July 2012 in IEEE Transactions on Information Theory |
Achieving the multiple access capacity region via projective time sharing PROCEEDINGS ARTICLE published in Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) |
Generalized multiple description coding with correlating transforms JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
Multiple transmit antenna differential detection from generalized orthogonal designs JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
Concatenated tree codes: a low-complexity, high-performance approach JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
The iterative turbo decoding algorithm has fixed points JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
Capacity-Achieving Distributions in Gaussian Multiple Access Channel With Peak Power Constraints JOURNAL ARTICLE published October 2014 in IEEE Transactions on Information Theory |
A rate-splitting approach to the Gaussian multiple-access channel JOURNAL ARTICLE published March 1996 in IEEE Transactions on Information Theory |
One stochastic process and its application to multiple access in supercritical region JOURNAL ARTICLE published May 2001 in IEEE Transactions on Information Theory |
Asymptotically optimal water-filling in vector multiple-access channels JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
Error exponents for the two-user Poisson multiple-access channel JOURNAL ARTICLE published July 2001 in IEEE Transactions on Information Theory |
A multiuser k-ary code for the noisy multiple-access adder channel JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
The capacity of low-density parity-check codes under message-passing decoding JOURNAL ARTICLE published 2001 in IEEE Transactions on Information Theory |
The capacity of discrete-time memoryless Rayleigh-fading channels JOURNAL ARTICLE published May 2001 in IEEE Transactions on Information Theory |
Spatial Capacity of Multiple-Access Wireless Networks JOURNAL ARTICLE published November 2006 in IEEE Transactions on Information Theory |