Title :
Identification via noiseless channels with noisy feedback
Author :
Kleinewächter, Christian
Author_Institution :
Fak. fur Math., Bielefeld Univ., Germany
Abstract :
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
Keywords :
channel capacity; codes; feedback; identification; memoryless systems; noise; channel capacity; deterministic identification code rate; discrete noise; lower bound; memoryless channels; noiseless channels; noisy feedback; upper bound; Constraint theory; Mathematics; Memoryless systems; Output feedback; Random variables; Stochastic resonance; Upper bound;
Conference_Titel :
Information Theory and Communications Workshop, 1999. Proceedings of the 1999 IEEE
Conference_Location :
Kruger National Park
Print_ISBN :
0-7803-5268-8
DOI :
10.1109/ITCOM.1999.781419
