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

2011/04/21 by Masahito Hayashi, Hayashi, Masahito, Ryutaroh Matsumoto +1
Computer Science · Engineering · #Computability, Logic, AI Algorithms #Cooperative Communication and Network Coding #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1104.4285

openalex publication_date 2011/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Error Exponents for Broadcast Channels with Degraded Message Sets
• Strong Converse Exponent for Degraded Broadcast Channels at Rates outside the Capacity Region
• Achievable Rates and Error Exponents for a Class of Mismatched Compound Channels
• A Tight Upper Bound on Mutual Information
• Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel