Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding

DOI10.1109/TIT.2014.2335733zbMATH Open1360.94222OpenAlexW1980288733MaRDI QIDQ2986131FDOQ2986131

Authors: Nir Weinberger, Neri Merhav 

Publication date: 16 May 2017

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

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

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35)

Cited In (5)

• Capacity-Achieving Guessing Random Additive Noise Decoding
• Random bit flipping and EXIT charts for nonuniform binary sources and joint source-channel turbo systems
• Noise Benefits in Quantizer-Array Correlation Detection and Watermark Decoding
• Finding $C_{\text{NRI}}({\mathcal W})$ , the Identification Capacity of the AVC ${\mathcal W}$ , if Randomization in the Encoding Is Excluded
• The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds

This page was built for publication: Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding

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