论文标题
确定性$ k $ - 缓慢褪色渠道的识别
Deterministic $K$-identification For Slow Fading Channel
论文作者
论文摘要
确定性$ K $ - 识别（DKI）是针对较慢衰落（GSF）的高斯通道的解决方案，其中发射器仅限于平均功率约束，并且在解码器上提供了通道侧信息。当可识别消息的数量$ k $随着CodeWord长度$ n $而言，我们将在DKI容量上获得下限和上限。作为一个关键发现，我们确定对于确定性编码的原因，假设可识别消息的数量$ k = 2^{κ\ log n} $，则使用$κ\ in [0,1）$是标识目标率，则代码书大小的尺寸为$ 2^{（n \ log n）r} $，其中$ r $是$ r $。
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^{κ\log n}$ with $κ\in [0,1)$ being the identification target rate, the codebook size scales as $2^{(n\log n)R}$, where $R$ is the coding rate.
