AI 中文总结
本文针对加性高斯信道的确定性识别容量未知的问题，引入新视角并结合格理论，建立了其确定性识别容量的紧界，为未来通信系统提供了理论支撑。
AI 中文摘要
现代通信系统对数据速率、可靠性和功率效率提出了严格要求。在此背景下，信道识别这类新兴通信范式已成为后香农信息论中的重要研究主题，相比传统信道可实现显著更高的识别速率，这对特定通信场景尤为有吸引力，因为它在实现复杂度与高识别速率带来的通信增益间实现了平衡，是包括分子通信系统在内的未来通信系统的 promising 通信方案。加性高斯信道，尤其是加性白高斯信道，是信息与通信理论中分析通信系统性能的最重要信道模型之一，其重要性源于数学可处理性及在实际应用中的普遍存在性。迄今为止，即使是加性白高斯信道这类最简单的情况，加性高斯信道的确定性识别容量仍未知。本文通过引入确定性识别的新视角，建立了加性高斯信道确定性识别容量的紧界，为此应用了格理论的结果以获得新的容量结果。
英文摘要
Modern communication systems impose strict demands on data rate, reliability, and power efficiency. In this context, emerging communication paradigms such as identification via channels have become an important topic in post-Shannon information theory, offering the potential for substantially higher identification rates than in conventional channel coding.Deterministic identification is particularly interesting for specialized communication scenarios because it provides a balance between implementation complexity and the communication gains due to higher identification rates. It is therefore a promising communication scheme for future communication systems, including molecular communication systems. Additive Gaussian channels, particularly the additive white Gaussian channel, are among the most important channel models for analyzing the performance of communication systems in information and communication theory. This importance stems from both their mathematical tractability and their ubiquitous appearance in practical applications. To date the deterministic identification capacity for additive Gaussian channels remains unknown even for the simplest case of the additive white Gaussian channel. In this paper, we establish tight bounds on the deterministic identification capacity of additive Gaussian channels by introducing a new perspective on deterministic identification. To this end, we apply results from lattice theory to obtain new capacity results.
CommentsFirst Edition 12. January 2026, Conference version submitted to ICC
