Expurgated Bounds for the Asymmetric Broadcast Channel

From MaRDI portal
Publication:5224006

DOI10.1109/TIT.2019.2898206zbMATH Open1432.94092arXiv1711.10299OpenAlexW2963928116WikidataQ128423370 ScholiaQ128423370MaRDI QIDQ5224006FDOQ5224006


Authors: Ran Averbuch, Nir Weinberger, Neri Merhav Edit this on Wikidata


Publication date: 19 July 2019

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

Abstract: This work contains two main contributions concerning the expurgation of hierarchical ensembles for the asymmetric broadcast channel. The first is an analysis of the optimal maximum likelihood (ML) decoders for the weak and strong user. Two different methods of code expurgation will be used, that will provide two competing error exponents. The second is the derivation of expurgated exponents under the generalized stochastic likelihood decoder (GLD). We prove that the GLD exponents are at least as tight as the maximum between the random coding error exponents derived in an earlier work by Averbuch and Merhav (2017) and one of our ML-based expurgated exponents. By that, we actually prove the existence of hierarchical codebooks that achieve the best of the random coding exponent and the expurgated exponent simultaneously for both users.


Full work available at URL: https://arxiv.org/abs/1711.10299




Recommendations




Cited In (1)





This page was built for publication: Expurgated Bounds for the Asymmetric Broadcast Channel

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