By Topic

Erasure, list, and detection zero-error capacities for low noise and a relation to identification

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
$31 $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

3 Author(s)
Ahlswede, R. ; Fakultat fur Math., Bielefeld Univ., Germany ; Ning Cai ; Zhen Zhang

For the discrete memoryless channel (χ, y, W) we give characterizations of the zero-error erasure capacity Cer and the zero-error average list size capacity Cal in terms of limits of suitable information (respectively, divergence) quantities (Theorem 1). However, they do not “single-letterize.” Next we assume that χ⊂y and W(x|x)>0 for all x∈χ, and we associate with W the low-noise channel Wε, where for y +(x)={y:W(y|x)>0} Wε(y|x)={1, if y=x and |y+(x)|=1 1-ε, if y=x and |y+(x)|>1 e/|y +(x)|-1, if y≠x. Our Theorem-2 says that as ε tends to zero the capacities Cer(Wε) and Cal (Wε) relate to the zero-error detection capacity C de(W). Our third result is a seemingly basic contribution to the theory of identification via channels. We introduce the (second-order) identification capacity Coid for identification codes with zero misrejection probability and misacceptance probability tending to zero. Our Theorem 3 says that Coid equals the zero-error erasure capacity for transmission Cer

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 1 )