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).
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
ORBGRAND-AI achieves the same or lower block error rate in ISI channels without interleaving compared to CA-SCL decoding with an interleaver at equal energy per information bit.
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).
-
Decoding in the presence of ISI without interleaving -- ORBGRAND-AI
ORBGRAND-AI achieves the same or lower block error rate in ISI channels without interleaving compared to CA-SCL decoding with an interleaver at equal energy per information bit.