A new proof of an inequality between two secrecy exponents

Michiwaki Ukyo, Yutaka Jitsumatsu

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

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.

元の言語英語
ホスト出版物のタイトルProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
出版者Institute of Electrical and Electronics Engineers Inc.
ページ747-751
ページ数5
ISBN(電子版)9784885523182
DOI
出版物ステータス出版済み - 3 8 2019
イベント15th International Symposium on Information Theory and Its Applications, ISITA 2018 - Singapore, シンガポール
継続期間: 10 28 201810 31 2018

出版物シリーズ

名前Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

会議

会議15th International Symposium on Information Theory and Its Applications, ISITA 2018
シンガポール
Singapore
期間10/28/1810/31/18

Fingerprint

Decoding

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems

これを引用

Ukyo, M., & Jitsumatsu, Y. (2019). A new proof of an inequality between two secrecy exponents. : Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 (pp. 747-751). [8664377] (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/ISITA.2018.8664377

A new proof of an inequality between two secrecy exponents. / Ukyo, Michiwaki; Jitsumatsu, Yutaka.

Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. Institute of Electrical and Electronics Engineers Inc., 2019. p. 747-751 8664377 (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018).

研究成果: 著書/レポートタイプへの貢献会議での発言

Ukyo, M & Jitsumatsu, Y 2019, A new proof of an inequality between two secrecy exponents. : Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018., 8664377, Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018, Institute of Electrical and Electronics Engineers Inc., pp. 747-751, 15th International Symposium on Information Theory and Its Applications, ISITA 2018, Singapore, シンガポール, 10/28/18. https://doi.org/10.23919/ISITA.2018.8664377
Ukyo M, Jitsumatsu Y. A new proof of an inequality between two secrecy exponents. : Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. Institute of Electrical and Electronics Engineers Inc. 2019. p. 747-751. 8664377. (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018). https://doi.org/10.23919/ISITA.2018.8664377
Ukyo, Michiwaki ; Jitsumatsu, Yutaka. / A new proof of an inequality between two secrecy exponents. Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 747-751 (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018).
@inproceedings{49345735a812425ba8350fe3d6f876a0,
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.",
author = "Michiwaki Ukyo and Yutaka Jitsumatsu",
year = "2019",
month = "3",
day = "8",
doi = "10.23919/ISITA.2018.8664377",
language = "English",
series = "Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "747--751",
booktitle = "Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018",
address = "United States",

}

TY - GEN

T1 - A new proof of an inequality between two secrecy exponents

AU - Ukyo, Michiwaki

AU - Jitsumatsu, Yutaka

PY - 2019/3/8

Y1 - 2019/3/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85063896117&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063896117&partnerID=8YFLogxK

U2 - 10.23919/ISITA.2018.8664377

DO - 10.23919/ISITA.2018.8664377

M3 - Conference contribution

T3 - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

SP - 747

EP - 751

BT - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -