Identification via noiseless channels with noisy feedback

摘要

We give an upper bound on the rate of deterministic identificationcode 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, Preprint94-010, 1994), so this gives the capacity for this type of channel