A Lagrange–Dual Lower Bound to the Error Exponent of the Typical Random Code

DOI10.1109/TIT.2019.2963392zbMATH Open1448.94148OpenAlexW2997589168MaRDI QIDQ5123938

Neri Merhav

Publication date: 29 September 2020

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

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

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Source coding (94A29)

Related Items (4)

Erratum to: ``Bounds on the rate of disjunctive codes ⋮ The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds ⋮ Non-Random Coding Error Bounds for Lattices ⋮ Average and reliability error exponents in low-density parity-check codes

This page was built for publication: A Lagrange–Dual Lower Bound to the Error Exponent of the Typical Random Code

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