Identification for Inverse Gaussian Channels

Abstract

We derive lower and upper bounds on the identification capacity of inverse Gaussian (IG) channels, a fundamental model for molecular communications in fluid environments. The analysis considers deterministic encoding schemes under a peak time constraint and characterizes the asymptotic growth of optimal codebook sizes. In the converse, by leveraging the Borel-Cantelli lemma and the super-exponential near-zero tail behavior of the IG distribution, we establish an almost-sure lower bound on the first-passage time of drifting diffusing molecules. This leads to the conclusion that the identification capacity exhibits super-exponential growth with the codeword length $n$, i.e., $\sim 2^{(n\log n)R_n}$, where $R_n$ is the coding rate.

arXiv comment53 pages, 3 figures; general refinements to Lemmas 3-5 used in the converse proof