Paper Info
Title
A New Proof Of An Inequality Between Two Secrecy Exponents
Abstract
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.
Year
DOI
Venue
2018
10.23919/ISITA.2018.8664377
PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018)
Field
DocType
Citations 
Discrete mathematics,Conditional probability,Exponent,Computer science,Probability distribution,Linear programming,Mutual information,Decoding methods,Lemma (mathematics),Computation
Conference
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Ukyo Michiwaki100.34
Yutaka Jitsumatsu22310.82