Identification capacity of ISI Gaussian channels permits super-exponential message growth ~2^(n log n R) even when ISI taps scale as n^κ for κ in [0, 1/2).
Deterministic K-Identification For Slow Fading Channels,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Identification for ISI Gaussian Channels
Identification capacity of ISI Gaussian channels permits super-exponential message growth ~2^(n log n R) even when ISI taps scale as n^κ for κ in [0, 1/2).
-
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.