General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel

Abstract

Several non-asymptotic formulas are established in channel resolvability and identification capacity, and they are applied to wire-tap channel. By using these formulas, the $\epsilon$ 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 in Han & Verdu and Han. Moreover, we obtain lower bounds of the exponents of error probability and the wire-tapper's information in wire-tap channel.

Cited by in corpus (2)

• Position-based coding and convex splitting for private communication over quantum channels
• Universally Attainable Error and Information Exponents, and Equivocation Rate for the Broadcast Channels with Confidential Messages