Error Exponents for Broadcast Channels With Degraded Message Sets

DOI10.1109/TIT.2010.2090233MaRDI QIDQ5281112zbMATH OpenOpenAlexFDO

Authors Yonatan Kaspi, Neri Merhav

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29) Decoding (94B35)

Abstract: We consider a broadcast channel with a degraded message set, in which a single transmitter sends a common message to two receivers and a private message to one of the receivers only. The main goal of this work is to find new lower bounds to the error exponents of the strong user, the one that should decode both messages, and of the weak user, that should decode only the common message. Unlike previous works, where suboptimal decoders where used, the exponents we derive in this work pertain to optimal decoding and depend on both rates. We take two different approaches. The first approach is based, in part, on variations of Gallager-type bounding techniques that were presented in a much earlier work on error exponents for erasure/list decoding. The resulting lower bounds are quite simple to understand and to compute. The second approach is based on a technique that is rooted in statistical physics, and it is exponentially tight from the initial step and onward. This technique is based on analyzing the statistics of certain enumerators. Numerical results show that the bounds obtained by this technique are tighter than those obtained by the first approach and previous results. The derivation, however, is more complex than the first approach and the retrieved exponents are harder to compute.

Recommendations

• Attainable Error Exponents for the Poisson Broadcast Channel With Degraded Message Sets
• Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel
• Error Exponent for Multiple-Access Channels: Lower Bounds
• On error exponents for arbitrarily varying channels
• Error Exponent for Multiple Access Channels: Upper Bounds
• Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels
• The Broadcast Channel With Degraded Message Sets and Unreliable Conference
• Error Exponents of Optimum Decoding for the Interference Channel
• On Error Exponents of Encoder-Assisted Communication Systems
• Error exponents of codings for stationary Gaussian channels

Cited in

(3)

• Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel
• Expurgated Bounds for the Asymmetric Broadcast Channel
• A toolbox for refined information-theoretic analyses

This page was built for publication: Error Exponents for Broadcast Channels With Degraded Message Sets

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