Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel

From MaRDI portal
Publication:5211639

DOI10.1109/TIT.2019.2922185zbMATH Open1434.94047arXiv1801.05112OpenAlexW2953306712WikidataQ127715078 ScholiaQ127715078MaRDI QIDQ5211639FDOQ5211639

Daming Cao, Vincent Y. F. Tan

Publication date: 28 January 2020

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

Abstract: Consider the asymmetric broadcast channel with a random superposition codebook, which may be comprised of constant composition or iid codewords. By applying Forney's optimal decoder for individual messages and the message pair for the receiver that decodes both messages, exact (ensemble-tight) error and erasure exponents are derived. It is shown that the optimal decoder designed to decode the pair of messages achieves the optimal trade-off between the total and undetected exponents associated with the optimal decoder for the private message. Convex optimization-based procedures to evaluate the exponents efficiently are proposed. Finally, numerical examples are presented to illustrate the results.


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






Cited In (3)


Recommendations





This page was built for publication: Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel

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