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

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

2005-03-31

arxiv.org/abs/cs/0503088v2

IEEE Transactions on Information Theory, Vol. 52, No. 4, 1562-1575 (2006)

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-720943