Universal decoding for memoryless Gaussian channels with a deterministic interference

DOI10.1109/18.243443MaRDI QIDQ4307328zbMATH OpenOpenAlexFDO

Authors Neri Merhav

Publication date 4 October 1994

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

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

zbMATH Keywords

universal decodingmaximum mutual informationmemoryless Gaussian channelsrandom coding error exponent

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Universal decoding for channels with memory
• Universal decoding for finite-state channels
• On the universality of the LZ-based decoding algorithm
• On the decoding of convolutional codes on an unknown channel
• scientific article; zbMATH DE number 3463521

Cited in

(7)

• Improving the generalized likelihood ratio test for unknown linear gaussian channels
• Universal Decoding for Gaussian Intersymbol Interference Channels
• Universal Communication—Part II: Channels With Memory
• A toolbox for refined information-theoretic analyses
• Universal decoding for finite-state channels
• Interference Decoding for Deterministic Channels
• scientific article; zbMATH DE number 3496010 (Why is no real title available?)

This page was built for publication: Universal decoding for memoryless Gaussian channels with a deterministic interference

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