Improved Random-Binning Exponent for Distributed Hypothesis Testing
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909751801020416 |
|---|---|
| author | Kochman, Yuval Wang, Ligong |
| author_facet | Kochman, Yuval Wang, Ligong |
| contents | Consider the problem of distributed binary hypothesis testing with two terminals, where the decision is made at one of them (the "receiver"). We study the exponent of the error probability of the second type. Previously, an achievable exponent was derived by Shimokawa, Han, and Amari using a "quantization and binning" scheme. We propose a simple modification on the receiver's decision rule in this scheme to attain a better exponent. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_14499 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Improved Random-Binning Exponent for Distributed Hypothesis Testing Kochman, Yuval Wang, Ligong Information Theory Consider the problem of distributed binary hypothesis testing with two terminals, where the decision is made at one of them (the "receiver"). We study the exponent of the error probability of the second type. Previously, an achievable exponent was derived by Shimokawa, Han, and Amari using a "quantization and binning" scheme. We propose a simple modification on the receiver's decision rule in this scheme to attain a better exponent. |
| title | Improved Random-Binning Exponent for Distributed Hypothesis Testing |
| topic | Information Theory |
| url | https://arxiv.org/abs/2306.14499 |