Identification plus transmission over channels with perfect feedback

We determine the region of all identification and transmission rate-pairs achievable over a discrete memoryless channel (DMC) with perfect and instantaneous feedback, for both randomized and deterministic encoding. As a by-product, we also have a new proof of Kemperman's (1973) strong converse to Shannon's coding theorem for DMC's with feedback.