Topics in Multi-User Information Theory
Foundations and Trends in Communications and Information Theory
Fairness in multiuser systems with polymatroid capacity region
IEEE Transactions on Information Theory
Admission control for multiple access in fading G-IC networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Side channel: bits over interference
Proceedings of the sixteenth annual international conference on Mobile computing and networking
New coding schemes for the symmetric K -description problem
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
It is shown that the encoding/decoding problem for any asynchronous M-user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2M-1 single-user discrete memoryless channels. This result, which extends a similar result for Gaussian channels, reduces the seemingly hard task of finding good multiple-access codes to the much better understood task of finding good codes for single-user channels. As a by-product, some interesting properties of the capacity region of M-user asynchronous discrete memoryless channels are derived