By Topic

Converse Coding Theorems for Identification via Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Oohama, Y. ; Dept. of Commun. Eng. & Inf., Univ. of Electro-Commun., Chofu, Japan

In identification via channels, the sum of two types of error probabilities of identification goes to one as the block length of transmission tends to infinity at rates above capacity when channels satisfy some stochastic properties. This is well known as a strong converse theorem for the identification via channels. In this paper, we prove that the sum of two error probabilities tends to one exponentially and derive an explicit lower bound of this exponent function.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 2 )