On the Reliability Function of Distributed Hypothesis Testing under Optimal Detection

Nir Weinberger; Yuval Kochman

doi:10.1109/ISIT.2018.8437756

On the Reliability Function of Distributed Hypothesis Testing under Optimal Detection

Nir Weinberger
, Yuval Kochman

The Rachel and Selim Benin School of Engineering and Computer Science

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

1 Scopus citations

Abstract

The distributed hypothesis-testing problem with full side-information is studied. The trade-off (reliability function) between the type 1 and type 2 error exponents under limited rate is studied in the following way. First, the problem of determining the reliability function of distributed hypothesis-testing is reduced to the problem of determining the reliability function of channel-detection codes (in analogy to a similar result which connects the reliability of distributed compression and ordinary channel codes). Second, a random-coding bound based on an hierarchical ensemble, as well as an expurgated bound, are derived for the reliability of channel-detection codes. The resulting bounds are the first to be derived for quantization-and-binning schemes under optimal detection.

Original language	English
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1066-1070
Number of pages	5
ISBN (Print)	9781538647806
DOIs	https://doi.org/10.1109/ISIT.2018.8437756
State	Published - 15 Aug 2018
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: 17 Jun 2018 → 22 Jun 2018

Publication series

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

Conference

Conference	2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/Territory	United States
City	Vail
Period	17/06/18 → 22/06/18

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

Access to Document

10.1109/ISIT.2018.8437756

Cite this

Weinberger, N., & Kochman, Y. (2018). On the Reliability Function of Distributed Hypothesis Testing under Optimal Detection. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 1066-1070). Article 8437756 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437756

@inproceedings{96a74de5556a48d0b4392ad6051fa0d1,

title = "On the Reliability Function of Distributed Hypothesis Testing under Optimal Detection",

abstract = "The distributed hypothesis-testing problem with full side-information is studied. The trade-off (reliability function) between the type 1 and type 2 error exponents under limited rate is studied in the following way. First, the problem of determining the reliability function of distributed hypothesis-testing is reduced to the problem of determining the reliability function of channel-detection codes (in analogy to a similar result which connects the reliability of distributed compression and ordinary channel codes). Second, a random-coding bound based on an hierarchical ensemble, as well as an expurgated bound, are derived for the reliability of channel-detection codes. The resulting bounds are the first to be derived for quantization-and-binning schemes under optimal detection.",

author = "Nir Weinberger and Yuval Kochman",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Symposium on Information Theory, ISIT 2018 ; Conference date: 17-06-2018 Through 22-06-2018",

year = "2018",

month = aug,

day = "15",

doi = "10.1109/ISIT.2018.8437756",

language = "אנגלית",

isbn = "9781538647806",

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

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

pages = "1066--1070",

booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",

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

}

Weinberger, N & Kochman, Y 2018, On the Reliability Function of Distributed Hypothesis Testing under Optimal Detection. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437756, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., pp. 1066-1070, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17/06/18. https://doi.org/10.1109/ISIT.2018.8437756

On the Reliability Function of Distributed Hypothesis Testing under Optimal Detection. / Weinberger, Nir; Kochman, Yuval.
2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 1066-1070 8437756 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June).

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

TY - GEN

T1 - On the Reliability Function of Distributed Hypothesis Testing under Optimal Detection

AU - Weinberger, Nir

AU - Kochman, Yuval

PY - 2018/8/15

Y1 - 2018/8/15

N2 - The distributed hypothesis-testing problem with full side-information is studied. The trade-off (reliability function) between the type 1 and type 2 error exponents under limited rate is studied in the following way. First, the problem of determining the reliability function of distributed hypothesis-testing is reduced to the problem of determining the reliability function of channel-detection codes (in analogy to a similar result which connects the reliability of distributed compression and ordinary channel codes). Second, a random-coding bound based on an hierarchical ensemble, as well as an expurgated bound, are derived for the reliability of channel-detection codes. The resulting bounds are the first to be derived for quantization-and-binning schemes under optimal detection.

AB - The distributed hypothesis-testing problem with full side-information is studied. The trade-off (reliability function) between the type 1 and type 2 error exponents under limited rate is studied in the following way. First, the problem of determining the reliability function of distributed hypothesis-testing is reduced to the problem of determining the reliability function of channel-detection codes (in analogy to a similar result which connects the reliability of distributed compression and ordinary channel codes). Second, a random-coding bound based on an hierarchical ensemble, as well as an expurgated bound, are derived for the reliability of channel-detection codes. The resulting bounds are the first to be derived for quantization-and-binning schemes under optimal detection.

UR - https://www.scopus.com/pages/publications/85052480785

U2 - 10.1109/ISIT.2018.8437756

DO - 10.1109/ISIT.2018.8437756

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

AN - SCOPUS:85052480785

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1066

EP - 1070

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 17 June 2018 through 22 June 2018

ER -

On the Reliability Function of Distributed Hypothesis Testing under Optimal Detection

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this