Title: Deterministic $K$-identification For Slow Fading Channel Show Chinese title

Title: 确定性$K$-识别 对于慢衰落信道

Abstract: Deterministic $K$-identification (DKI) is addressed for Gaussian channels with slow fading (GSF), where the transmitter is restricted to an average power constraint and channel side information is available at the decoder. We derive lower and upper bounds on the DKI capacity when the number of identifiable messages $K$ may grow sub-linearly with the codeword length $n$. As a key finding, we establish that for deterministic encoding, assuming that the number of identifiable messages $K = 2^{\kappa \log n}$ with $\kappa \in [0,1)$ being the identification target rate, the codebook size scales as $2^{(n\log n)R}$, where $R$ is the coding rate. Show Chinese abstract

Abstract: 确定性$K$-识别 (DKI) 被用于具有慢衰落的高斯信道 (GSF)，其中发送端受到平均功率约束，解码器处有信道侧信息。 当可识别消息的数量$K$可以随着码字长度$n$以次线性方式增长时，我们推导出 DKI 容量的下界和上界。 作为一个关键发现，我们建立了一个结论，对于确定性编码，假设可识别消息的数量$K = 2^{\kappa \log n}$，其中$\kappa \in [0,1)$是识别目标速率，码本大小按$2^{(n\log n)R}$缩放，其中$R$是编码速率。