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