In the identification (ID) scheme proposed by Ahlswede and Dueck, the receiver only checks whether a message of special interest to him has been sent or not. In contrast to Shannon transmission codes, the size of ID codes for a Discrete Memoryless Channel (DMC) grows doubly exponentially fast with the blocklength, if randomized encoding is used. This groundbreaking result makes the ID paradigm more efficient than the classical Shannon transmission in terms of necessary energy and hardware components. Further gains can be achieved by taking advantage of additional resources such as feedback. We study the problem of joint ID and channel state estimation over a DMC with independent and identically distributed (i.i.d.) state sequences. The sender simultaneously sends an ID message over the DMC with a random state and estimates the channel state via a strictly causal channel output. The random channel state is available to neither the sender nor the receiver. For the proposed system model, we establish a lower bound on the ID capacity-distortion function.

翻译：在Ahlswede和Dueck提出的识别（ID）方案中，接收方仅检查其特别关注的消息是否已被发送。与Shannon传输码不同，若采用随机编码，离散无记忆信道（DMC）的ID码字规模随码块长度呈双重指数增长。这一突破性成果表明，在所需能量和硬件组件方面，ID范式比经典Shannon传输更具效率。通过利用反馈等额外资源，可进一步获得增益。我们研究了具有独立同分布（i.i.d.）状态序列的DMC上联合ID与信道状态估计问题。发送方通过含随机状态的DMC同时发送ID消息，并利用严格因果的信道输出来估计信道状态。随机信道状态对发送方和接收方均不可知。针对所提出的系统模型，我们建立了ID容量-失真函数的下界。