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).
Blind decoding of Linear Gaussian channels with ISI, capacity, error exponent, universality
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
A new straightforward universal blind detection algorithm for linear Gaussian channel with ISI is given. A new error exponent is derived, which is better than Gallager's random coding error exponent.
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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).