The linearithmic deterministic identification capacity of Gaussian channels is 1/2, achieved by an optimized code that matches the upper bound and closes gaps in rate-reliability tradeoffs for all error regimes.
Identification without randomization,
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
-
Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap
The linearithmic deterministic identification capacity of Gaussian channels is 1/2, achieved by an optimized code that matches the upper bound and closes gaps in rate-reliability tradeoffs for all error regimes.