Universally Attainable Error and Information Exponents, and Equivocation Rate for the Broadcast Channels with Confidential Messages

Abstract

We show universally attainable exponents for the decoding error and the mutual information and universally attainable equivocation rates for the conditional entropy for the broadcast channels with confidential messages. The error exponents are the same as ones given by Korner and Sgarro for the broadcast channels with degraded message sets.

IEEEtran.sty, 6 pages, resubmitted to Allerton Conference. Ver. 1 incorrectly stated \exp(ψ) is concave in Prop. 7, which is corrected in V2. V3 changed the title and the proof argument. The results are the same in all versions

References in corpus (2)

• General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel
• Strong security and separated code constructions for the broadcast channels with confidential messages

Cited by in corpus (2)

• Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages
• On the Secrecy Exponent of the Wire-tap Channel