The Binomial channel serves as a fundamental model for molecular communication (MC) systems employing molecule-counting receivers. Here, deterministic identification (DI) is addressed for the discrete-time Binomial channels (DTBC), subject to an average and a peak constraint on the molecule release rate. We establish that the number of different messages that can be reliably identified for the DTBC scales as $2^{(n\log n)R}$, where $n$ and $R$ are the codeword length and coding rate, respectively. Lower and upper bounds on the DI capacity of the DTBC are developed.

翻译：二项信道是采用分子计数接收器的分子通信（MC）系统的基础模型。本文针对离散时间二项信道（DTBC），在分子释放速率的平均约束和峰值约束下，研究了确定性标识（DI）问题。我们证明，在DTBC中可可靠标识的不同消息数量按$2^{(n\log n)R}$缩放，其中$n$和$R$分别表示码字长度和编码速率。本文给出了DTBC的DI容量的下界和上界。