Timing Channels with Multiple Identical Quanta

We consider mutual information between release times and capture times for a set of M identical quanta traveling independently from a source to a target. The quanta are immediately captured upon arrival, first-passage times are assumed independent and identically distributed and the quantum emission times are constrained by a deadline. The primary application area is intended to be inter/intracellular molecular signaling in biological systems whereby an organelle, cell or group of cells must deliver some message (such as transcription or developmental instructions) over distance with reasonable certainty to another organelles, cells or group of cells. However, the model can also be applied to communications systems wherein indistinguishable signals have random transit latencies.

💡 Research Summary

The paper investigates the information‑theoretic limits of a timing channel in which M identical “quanta” are emitted from a source, travel independently, and are captured immediately upon arrival at a target. Each quantum’s travel time is modeled as a first‑passage time (FPT) X₁,…,X_M that are independent and identically distributed (i.i.d.) with a generic probability density f_X(x) and cumulative distribution F_X(x). Emission times are collected in a vector t = (t₁,…,t_M) subject to the deadline constraint 0 ≤ t₁ ≤ … ≤ t_M ≤ τ, where τ represents the latest allowable emission moment. The arrival (capture) times are s_i = t_i + X_i. Because the quanta are indistinguishable, the receiver cannot label individual arrivals; it only observes the ordered set S = {S_(1),…,S_(M)} obtained by sorting the s_i’s in ascending order. This loss of label information is the central source of entropy reduction in the channel.

The authors first derive the joint distribution of the unsorted arrival vector Y = t + X and then average over all M! permutations to obtain the distribution of the ordered vector S. The permutation averaging introduces a deterministic entropy loss of log(M!) bits, reflecting the fact that any of the M! possible labelings of the same set of arrival times are indistinguishable to the receiver. Consequently, the mutual information between the emission schedule T and the observable ordered arrivals S, I(T;S), is bounded above by the mutual information that would be achieved if the quanta were distinguishable, minus the permutation loss.

Two explicit capacity bounds are presented. The upper bound assumes fully distinguishable quanta, giving a per‑quantum single‑channel capacity C_single (evaluated from the FPT distribution and the deadline τ). The total capacity for M distinguishable quanta would be M·C_single; after accounting for the loss due to indistinguishability, the bound becomes
  C ≤ M·C_single − log(M!).
The lower bound is constructed by choosing a simple emission policy: emit the M quanta uniformly over the interval