Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel

DOI10.1109/TIT.2018.2836668MaRDI QIDQ4682820zbMATH OpenFDO

Authors Ran Averbuch, Neri Merhav

Publication date 19 September 2018

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

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

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Abstract: This work contains two main contributions concerning the asymmetric broadcast channel. The first is an analysis of the exact random coding error exponents for both users, and the second is the derivation of universal decoders for both users. These universal decoders are certain variants of the maximum mutual information (MMI) universal decoder, which achieve the corresponding random coding exponents of optimal decoding. In addition, we introduce some lower bounds, which involve optimization over very few parameters, unlike the original, exact exponents, which involve minimizations over auxiliary probability distributions. Numerical results for the binary symmetric broadcast channel show improvements over previously derived error exponents for the same model.

Cited in

(5)

• On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels
• Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel
• Expurgated Bounds for the Asymmetric Broadcast Channel
• A toolbox for refined information-theoretic analyses
• Random bit flipping and EXIT charts for nonuniform binary sources and joint source-channel turbo systems

This page was built for publication: Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel

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