Identification capacity bounds for colored Gaussian channels with polynomially bounded noise spectrum and sub-linear ISI memory allow super-exponential codebook growth of order 2^(n log n R).
Identification Without Randomization
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 Colored Gaussian Channels
Identification capacity bounds for colored Gaussian channels with polynomially bounded noise spectrum and sub-linear ISI memory allow super-exponential codebook growth of order 2^(n log n R).
-
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.