Identification over Channels with Feedback: Discontinuity Behavior and Super-Activation

Abstract

The problem of identification is considered, in which it is of interest for the receiver to decide only whether a certain message has been sent or not, and the identification-feedback (IDF) capacity of channels with feedback is studied. The IDF capacity is shown to be discontinuous and super-additive for both deterministic and randomized encoding. For the deterministic IDF capacity the phenomenon of super-activation occurs, which is the strongest form of super-additivity. For the randomized IDF capacity, super-activation is not possible. These findings imply that the IDF capacity is not Turing computable.