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).
A Mathematical Theory of Communication,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Conserved active information I^⊕ is introduced as a symmetric measure of net information change across an entire search space that respects No-Free-Lunch conservation and distinguishes disorder-increasing from order-imposing knowledge.
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).
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).
-
Conserved active information
Conserved active information I^⊕ is introduced as a symmetric measure of net information change across an entire search space that respects No-Free-Lunch conservation and distinguishes disorder-increasing from order-imposing knowledge.
-
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).