English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the second-order asymptotics of information transmission usingrandom Gaussian codebooks and nearest neighbor (NN) decoding over apower-limited stationary memoryless additive non-Gaussian noise channel. Weshow that the dispersion term depends on the non-Gaussian noise only throughits second and fourth moments, thus complementing the capacity result(Lapidoth, 1996), which depends only on the second moment. Furthermore, wecharacterize the second-order asymptotics of point-to-point codes over$K$-sender interference networks with non-Gaussian additive noise.Specifically, we assume that each user's codebook is Gaussian and that NNdecoding is employed, i.e., that interference from the $K-1$ unintended users(Gaussian interfering signals) is treated as noise at each decoder. We showthat while the first-order term in the asymptotic expansion of the maximumnumber of messages depends on the power of the interferring codewords onlythrough their sum, this does not hold for the second-order term.

The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian Channels