Referenced Items are not available for this document.
The coding theorem is proved for the system with two noisy channels, each of which is a broadcast channel. It is assumed that the legitimate channel is less noisy than the wiretapped channel. The admissible region of rates and security levels is obtained completely. The relationship of the present results to previous results is examined
Published in:
Information Theory, IEEE Transactions on
(Volume:35
,
Issue:
3
)
Date of Publication: May 1989
- Page(s):
- 572 - 578
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 3476783
- Digital Object Identifier :
- 10.1109/18.30979
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- May 1989
- 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.
