AI 中文总结
该研究将通用最优（UO）码与信息论问题关联，证明其在主信道无噪的窃听信道场景中可优化α=2时的α互信息，是此类信道传输的最优编码。
AI 中文摘要
通用最优（UO）码由H. Cohn和A. Kumar于2007年提出，后由Cohn与Y. Zhao扩展到离散场景；这类码在某类势函数下，于相同规模的所有码中使“能量”最小。迄今为止，仅少数特定泛函与信息论问题相关联。本文新增关联，证明在主信道无噪的窃听信道场景中，UO码可优化α=2时的α互信息，这意味着UO码在这类窃听信道的传输中是最优的。
英文摘要
Universally optimal (UO) codes were introduced by H. Cohn and A. Kumar in 2007 and later extended to the discrete setting by Cohn and Y. Zhao. They minimize the ``energy'' among all codes of the same size for a certain class of potential functions. So far only a small number of specific functionals have been linked to information theory problems. We add one more, showing that UO codes optimize $α$-mutual information for $α=2$ in the context of wiretap channels with a noiseless main channel. This implies that UO codes are optimal for transmission over this type of wiretap channels.
CommentsAccepted to IEEE ISIT 2026
