Proof of Convergence for Correct-Decoding Exponent Computation

Sergey Tridenski; Anelia Somekh-Baruch; Ram Zamir

doi:10.1109/ISIT44484.2020.9174321

Proof of Convergence for Correct-Decoding Exponent Computation

Sergey Tridenski, Anelia Somekh-Baruch, Ram Zamir

School of Electrical Engineering

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

For a discrete memoryless channel with finite input and output alphabets, we prove convergence of an iterative computation of the optimal correct-decoding exponent as a function of communication rate, for a fixed rate and for a fixed slope.

Original language	English
Title of host publication	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2137-2142
Number of pages	6
ISBN (Electronic)	9781728164328
DOIs	https://doi.org/10.1109/ISIT44484.2020.9174321
State	Published - Jun 2020
Event	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States Duration: 21 Jul 2020 → 26 Jul 2020

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2020-June
ISSN (Print)	2157-8095

Conference

Conference	2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/Territory	United States
City	Los Angeles
Period	21/07/20 → 26/07/20

Access to Document

10.1109/ISIT44484.2020.9174321

Cite this

Tridenski, S., Somekh-Baruch, A., & Zamir, R. (2020). Proof of Convergence for Correct-Decoding Exponent Computation. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings (pp. 2137-2142). Article 9174321 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT44484.2020.9174321

@inproceedings{c69a7f00c27c4d13b127debec62d9e32,

title = "Proof of Convergence for Correct-Decoding Exponent Computation",

abstract = "For a discrete memoryless channel with finite input and output alphabets, we prove convergence of an iterative computation of the optimal correct-decoding exponent as a function of communication rate, for a fixed rate and for a fixed slope.",

author = "Sergey Tridenski and Anelia Somekh-Baruch and Ram Zamir",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 2020 IEEE International Symposium on Information Theory, ISIT 2020 ; Conference date: 21-07-2020 Through 26-07-2020",

year = "2020",

month = jun,

doi = "10.1109/ISIT44484.2020.9174321",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2137--2142",

booktitle = "2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings",

address = "ארצות הברית",

}

Tridenski, S, Somekh-Baruch, A & Zamir, R 2020, Proof of Convergence for Correct-Decoding Exponent Computation. in 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings., 9174321, IEEE International Symposium on Information Theory - Proceedings, vol. 2020-June, Institute of Electrical and Electronics Engineers Inc., pp. 2137-2142, 2020 IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, United States, 21/07/20. https://doi.org/10.1109/ISIT44484.2020.9174321

Proof of Convergence for Correct-Decoding Exponent Computation. / Tridenski, Sergey; Somekh-Baruch, Anelia; Zamir, Ram.
2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2020. p. 2137-2142 9174321 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Proof of Convergence for Correct-Decoding Exponent Computation

AU - Tridenski, Sergey

AU - Somekh-Baruch, Anelia

AU - Zamir, Ram

PY - 2020/6

Y1 - 2020/6

N2 - For a discrete memoryless channel with finite input and output alphabets, we prove convergence of an iterative computation of the optimal correct-decoding exponent as a function of communication rate, for a fixed rate and for a fixed slope.

AB - For a discrete memoryless channel with finite input and output alphabets, we prove convergence of an iterative computation of the optimal correct-decoding exponent as a function of communication rate, for a fixed rate and for a fixed slope.

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

U2 - 10.1109/ISIT44484.2020.9174321

DO - 10.1109/ISIT44484.2020.9174321

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85090403639

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2137

EP - 2142

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

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020

Y2 - 21 July 2020 through 26 July 2020

ER -

Tridenski S, Somekh-Baruch A, Zamir R. Proof of Convergence for Correct-Decoding Exponent Computation. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2020. p. 2137-2142. 9174321. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT44484.2020.9174321

Proof of Convergence for Correct-Decoding Exponent Computation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this