Identification capacity of inverse Gaussian channels grows super-exponentially as ~2^(n log n R) under deterministic encoding and mild regularity on the first-arrival-time noise.
Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear Rates
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Identification for Inverse Gaussian Channels
Identification capacity of inverse Gaussian channels grows super-exponentially as ~2^(n log n R) under deterministic encoding and mild regularity on the first-arrival-time noise.