Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel

by   Daming Cao, et al.
National University of Singapore
Southeast University

We derive exact (ensemble-tight) error and erasure exponents for the asymmetric broadcast channel given a random superposition codebook. We consider Forney's optimal decoder for both messages and the message pair for the receiver that decodes both messages. We prove 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. We propose convex optimization-based procedures to evaluate the exponents efficiently. Numerical examples are presented to illustrate the results.


page 1

page 2

page 3

page 4


Expurgated Bounds for the Asymmetric Broadcast Channel

This work contains two main contributions concerning the expurgation of ...

Capacity Results for the K-User Broadcast Channel with Two Nested Multicast Messages

The K-user discrete memoryless (DM) broadcast channel (BC) with two nest...

Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast Channel

The 2-receiver broadcast channel is studied: a network with three partie...

Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages

We derive universal codes for transmission of broadcast and confidential...

Embedding Covert Information in Broadcast Communications

We analyze a two-receiver binary-input discrete memoryless broadcast cha...

Learning Symmetric and Asymmetric Steganography via Adversarial Training

Steganography refers to the art of concealing secret messages within mul...

The throughput in multi-channel (slotted) ALOHA: large deviations and analysis of bad events

We consider ALOHA and slotted ALOHA protocols as medium access rules for...

Please sign up or login with your details

Forgot password? Click here to reset