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 MC Poisson Channel With Inter-Symbol Interference,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.IT 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
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 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 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.