General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel
Top Cited Papers
- 3 April 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 52 (4) , 1562-1575
- https://doi.org/10.1109/tit.2006.871040
Abstract
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 channelKeywords
This publication has 12 references indexed in Scilit:
- Error probability of identification via channels at rates above capacityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- General formulas for capacity of classical-quantum channelsIEEE Transactions on Information Theory, 2003
- Strong converse for identification via quantum channelsIEEE Transactions on Information Theory, 2002
- Common randomness and secret key generation with a helperIEEE Transactions on Information Theory, 2000
- New converses in the theory of identification via channelsIEEE Transactions on Information Theory, 1998
- A general formula for channel capacityIEEE Transactions on Information Theory, 1994
- Approximation theory of output statisticsIEEE Transactions on Information Theory, 1993
- Identification via channelsIEEE Transactions on Information Theory, 1989
- The Wire-Tap ChannelBell System Technical Journal, 1975
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)IEEE Transactions on Information Theory, 1973