Summary
The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)
2018
Session Number:We-PM-2-4
Session:
Number:We-PM-2-4.3
A new proof of an inequality between two secrecy exponents
Michiwaki Ukyo, Yutaka Jitsumatsu,
pp.779-783
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-PM-2-4.3
PDF download
Summary:
Hayashi and Matsumoto gave two lower bounds for the secrecy exponent for wiretap channels in 2011 and 2016. They proved that the latter exponent function is greater than or equal to the former one for any positive rate, input distribution and conditional probability of wiretapper’s channel. In this paper, we give a new and simple proof of the inequality between the two exponent functions. To prove the inequality we use non-negativity of Kullback-Leibler distance together with a lemma that was introduced by Arimoto to derive a computation algorithm for error and correct decoding probability exponent for discrete memoryless channels.