New Strong Converse for Asymmetric Broadcast Channels

Abstract

We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.

20 pages, 1 figures, a short version of this paper is submitted to the International Symposium on Information Theory and Its Applications(ISITA),October 30-November 2, 2016, Monterey, California, USA. arXiv admin note: text overlap with arXiv:1603.06344, arXiv:1601.05650

Cited by in corpus (4)

• Time-Division is Optimal for Covert Communication over Some Broadcast Channels
• A New Inequality Related to Proofs of Strong Converse Theorems for Source or Channel Networks
• Exponential Strong Converse for Content Identification with Lossy Recovery
• Strong Converse Exponent for State Dependent Channels With Full State Information at the Sender