Deterministic K-Identification (DKI) for the binary symmetric channel (BSC) is developed. A full characterization of the DKI capacity for such a channel, with and without the Hamming weight constraint, is established. As a key finding, we find that for deterministic encoding the number of identifiable messages $K$ may grow exponentially with the codeword length $n$, i.e., $K = 2^{\kappa n}$, where $\kappa$ is the target identification rate. Furthermore, the eligible region for $\kappa$ as a function of the channel statistics, i.e., the crossover probability, is determined.

翻译：针对二元对称信道（BSC）发展了确定性K-识别（DKI）方法。我们建立了该信道在有无汉明权重约束下的DKI容量的完整表征。关键发现表明，对于确定性编码，可识别消息数量$K$可能随码字长度$n$呈指数增长，即$K = 2^{\kappa n}$，其中$\kappa$为目标识别速率。此外，我们确定了作为信道统计量（即交叉概率）函数的$\kappa$的可行区域。