We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon Theory. The consideration of communication systems beyond Shannon's approach is useful in order to increase the efficiency of information transmission for certain applications. We propose a coding scheme that first generates infinite common randomness between the sender and the receiver. If the channel has a positive message transmission feedback capacity, for given error thresholds and sufficiently large blocklength this common randomness is then used to construct arbitrarily large deterministic identification codes. In particular, the deterministic identification feedback capacity is infinite regardless of the scaling (exponential, doubly exponential, etc.) chosen for the capacity definition. Clearly, if randomized encoding is allowed in addition to the use of feedback, these results continue to hold.

翻译：我们用非分辨添加白噪音的渠道分析确定信息的身份,并在平均功率和峰值功率限制下使用无噪音的反馈链接。识别任务属于香农后理论的一部分。考虑香农方法之外的通信系统对于提高某些应用程序的信息传输效率是有用的。我们建议了一个编码办法,首先在发送者和接收者之间产生无限的共同随机性。如果频道具有正面的信息传输反馈能力,根据给定的差错阈值和足够长的整块宽度,这种共同随机性被用来建立任意的大型确定性识别代码。特别是,确定性识别反馈能力是无限的,不管为能力定义所选择的尺度大小(耗尽、双倍指数等)如何。很显然,如果允许随机编码,除了使用反馈之外,还允许使用随机编码,这些结果将继续维持下去。