Universally Attainable Error and Information Exponents, and Equivocation Rate for the Broadcast Channels with Confidential Messages
Information Theory
2011-10-04 v4 Cryptography and Security
math.IT
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.
Keywords
Cite
@article{arxiv.1104.4285,
title = {Universally Attainable Error and Information Exponents, and Equivocation Rate for the Broadcast Channels with Confidential Messages},
author = {Masahito Hayashi and Ryutaroh Matsumoto},
journal= {arXiv preprint arXiv:1104.4285},
year = {2011}
}
Comments
IEEEtran.sty, 6 pages, resubmitted to Allerton Conference. Ver. 1 incorrectly stated \exp(\psi) 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