Referenced Items are not available for this document.
The random-code capacity region of a multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general
Published in:
Information Theory, IEEE Transactions on
(Volume:41
,
Issue:
1
)
Date of Publication: Jan 1995
- Page(s):
- 3 - 13
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 4893653
- Digital Object Identifier :
- 10.1109/18.370123
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jan 1995
- 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.
