2000 character limit reached
Deterministic Identification For MC Binomial Channel (2304.12493v1)
Published 24 Apr 2023 in cs.IT and math.IT
Abstract: 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.