A new proof of an inequality between two secrecy exponents

Michiwaki Ukyo, Yutaka Jitsumatsu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages747-751
Number of pages5
ISBN (Electronic)9784885523182
DOIs
Publication statusPublished - Mar 8 2019
Event15th International Symposium on Information Theory and Its Applications, ISITA 2018 - Singapore, Singapore
Duration: Oct 28 2018Oct 31 2018

Publication series

NameProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

Conference

Conference15th International Symposium on Information Theory and Its Applications, ISITA 2018
CountrySingapore
CitySingapore
Period10/28/1810/31/18

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'A new proof of an inequality between two secrecy exponents'. Together they form a unique fingerprint.

Cite this