Exact Random Coding Exponents for Erasure Decoding

DOI10.1109/TIT.2011.2165826MaRDI QIDQ5272274zbMATH OpenOpenAlexFDO

Authors Anelia Somekh-Baruch, Neri Merhav

Publication date 12 July 2017

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

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

Mathematics Subject Classification ID

Combinatorial probability (60C99) Inequalities; stochastic orderings (60E15) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Cited in

(7)

• Erasure/List Random Coding Error Exponents Are Not Universally Achievable
• Exact Random Coding Error Exponents of Optimal Bin Index Decoding
• Exact decoding probability of random linear network coding for combinatorial networks
• Minimax Universal Decoding With an Erasure Option
• Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule
• The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds
• A toolbox for refined information-theoretic analyses

This page was built for publication: Exact Random Coding Exponents for Erasure Decoding

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