By Topic

Identification via noiseless channels with noisy feedback

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)
Kleinewachter, C. ; Fak. fur Math., Bielefeld Univ., Germany

We give an upper bound on the rate of deterministic identification code for discrete noise and memoryless channels with noisy feedback. This upper bound coincides with the lower bound of Ahlswede and Zhang (see SFB 343 Diskrete Strukturen in der Mathematik, Bielefeld, Preprint 94-010, 1994), so this gives the capacity for this type of channel

Published in:

Information Theory and Communications Workshop, 1999. Proceedings of the 1999 IEEE

Date of Conference: