Ahlswede and Dueck identification has the potential of exponentially reducing traffic or exponentially increasing rates in applications where a full decoding of the message is not necessary and, instead, a simple verification of the message of interest suffices. However, the proposed constructions can suffer from exponential increase in the computational load at the sender and receiver, rendering these advantages unusable. This has been shown in particular to be the case for a construction achieving identification capacity based on concatenated Reed-Solomon codes. Here, we consider the natural generalization of identification based on Reed-Muller codes and we show that, although without achieving identification capacity, they allow to achieve the exponentially large rates mentioned above without the computational penalty increasing too much the latency with respect to transmission.

翻译：阿尔斯韦德和杜埃克识别在无需完全解码消息、仅需验证目标消息即可的应用场景中，具有指数级减少通信量或指数级提升速率的潜力。然而，已有构造方案可能导致发送端和接收端的计算负荷呈指数级增长，从而削弱这些优势。尤其值得注意的是，基于级联里德-所罗门码的识别容量构建方案已证实存在此类问题。本文考虑基于里德-穆勒码的识别这一自然推广形式，并证明：尽管未达到识别容量，该方案仍能在不因计算代价而显著增加相对传输时延的前提下，实现前述指数级高速率。