Referenced Items are not available for this document.
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.
Published in:
Information Theory, IEEE Transactions on
(Volume:31
,
Issue:
6
)
Date of Publication: Nov 1985
- Page(s):
- 741 - 750
- ISSN :
- 0018-9448
- Digital Object Identifier :
- 10.1109/TIT.1985.1057104
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 January 2003
- Issue Date :
- Nov 1985
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
