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

Yasutada Oohama, Yutaka Jitsumatsu

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

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages924-928
Number of pages5
Volume2015-June
ISBN (Electronic)9781467377041
DOIs
Publication statusPublished - Sep 28 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: Jun 14 2015Jun 19 2015

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period6/14/156/19/15

Fingerprint

Iterative Algorithm
Decoding
Exponent
Computing
Lower bound

All Science Journal Classification (ASJC) codes

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

Cite this

Oohama, Y., & Jitsumatsu, Y. (2015). A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (Vol. 2015-June, pp. 924-928). [7282590] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282590

A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels. / Oohama, Yasutada; Jitsumatsu, Yutaka.

Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. p. 924-928 7282590.

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

Oohama, Y & Jitsumatsu, Y 2015, A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. vol. 2015-June, 7282590, Institute of Electrical and Electronics Engineers Inc., pp. 924-928, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7282590
Oohama Y, Jitsumatsu Y. A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June. Institute of Electrical and Electronics Engineers Inc. 2015. p. 924-928. 7282590 https://doi.org/10.1109/ISIT.2015.7282590
Oohama, Yasutada ; Jitsumatsu, Yutaka. / A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels. Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. pp. 924-928
@inproceedings{f9b40d6e070f4229a2710172b382d204,
title = "A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels",
abstract = "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{\"o}rner determined the optimal exponent function of the correct decoding probability. In this paper, a new iterative algorithm that computes Dueck and K{\"o}rner's exponent is presented.",
author = "Yasutada Oohama and Yutaka Jitsumatsu",
year = "2015",
month = "9",
day = "28",
doi = "10.1109/ISIT.2015.7282590",
language = "English",
volume = "2015-June",
pages = "924--928",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

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

AU - Oohama, Yasutada

AU - Jitsumatsu, Yutaka

PY - 2015/9/28

Y1 - 2015/9/28

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

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

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

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

U2 - 10.1109/ISIT.2015.7282590

DO - 10.1109/ISIT.2015.7282590

M3 - Conference contribution

AN - SCOPUS:84969752567

VL - 2015-June

SP - 924

EP - 928

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -