.png){kind=icon}
Return
Improved Random-Binning Exponent for Distributed Hypothesis Testing
.png){kind=icon}
PRE
AI
DOI：10.1109/TIT.2025.3603269.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Receivers
Error probability
Testing
Indexes
IP networks
Observers
Mutual information
Training
Electronic mail
Decoding
Binning
distributed hypothesis testing
error exponent
Journal
I
IF:
2.9
Papers:
317
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSave
View more