Referenced Items are not available for this document.
Several nonasymptotic formulas are established in channel resolvability and identification capacity, and they are applied to the wiretap channel. By using these formulas, the epsi capacities of the above three problems are considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. As a result, we solve an open problem proposed by Han and Verduacute. Moreover, we obtain lower bounds of the exponents of error probability and the wiretapper's information in the wiretap channel
Published in:
Information Theory, IEEE Transactions on
(Volume:52
,
Issue:
4
)
Date of Publication: April 2006
- Page(s):
- 1562 - 1575
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 8878725
- Digital Object Identifier :
- 10.1109/TIT.2006.871040
- Date of Current Version :
- 03 April 2006
- Issue Date :
- April 2006
- 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.
