A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels

Yasutada Oohama, Yutaka Jitsumatsu

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

5 被引用数 (Scopus)

抄録

For a discrete memoryless channel, a lower bound for the correct decoding probability exponent was derived by Arimoto. He also gave an iterative algorithm for computing the exponent. Subsequently, Dueck and Körner determined the optimal exponent function of the correct decoding probability. In this paper, a new iterative algorithm that computes Dueck and Körner's exponent is presented.

本文言語英語
ホスト出版物のタイトルProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
出版社Institute of Electrical and Electronics Engineers Inc.
ページ924-928
ページ数5
ISBN(電子版)9781467377041
DOI
出版ステータス出版済み - 9 28 2015
イベントIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, 香港
継続期間: 6 14 20156 19 2015

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
2015-June
ISSN(印刷版)2157-8095

その他

その他IEEE International Symposium on Information Theory, ISIT 2015
Country香港
CityHong Kong
Period6/14/156/19/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

フィンガープリント 「A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル