Random coding bound and codes produced by permutations for the multiple-access channel
- 1 November 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 31 (6) , 741-750
- https://doi.org/10.1109/tit.1985.1057104
Abstract
A random coding bound for the multiple-access channel (MAC) is given, and it is shown to be obtainable universally for all MAC's with common input and output alphabets. For channels for which the random coding bound may be achieved by codes consisting of codewords of a single type for each sender, this bound is also achievable by codes produced by permutations.Keywords
This publication has 4 references indexed in Scilit:
- Good codes can be produced by a few permutationsIEEE Transactions on Information Theory, 1982
- Graph decomposition: A new key to coding theoremsIEEE Transactions on Information Theory, 1981
- A note on the capacity region of the multiple-access channel (Corresp.)IEEE Transactions on Information Theory, 1979
- The Capacity Region of a Channel with Two Senders and Two ReceiversThe Annals of Probability, 1974