Nearest neighbor decoding for additive non-Gaussian noise channels

DOI10.1109/18.532892zbMATH Open0860.94019OpenAlexW2119584244MaRDI QIDQ4896830FDOQ4896830

Amos Lapidoth

Publication date: 28 April 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.532892

zbMATH Keywords

fading channelsmultiple-access channelsnearest neighbor decoding

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Channel models (including quantum) in information and communication theory (94A40)

Cited In (2)

• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian Channels

   Recommendations

• On the capacity of channels with Gaussian and non-Gaussian noise 👍 👎
• Coding capacity for a class of additive channels 👍 👎
• Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels 👍 👎
• Performance of nonuniform constellations on the Gaussian channel 👍 👎

This page was built for publication: Nearest neighbor decoding for additive non-Gaussian noise channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896830)