On the Optimality of Binning for Distributed Hypothesis Testing
From MaRDI portal
Cited in
(5)- Fundamental structures and asymptotic performance criteria in decentralized binary hypothesis testing
- Efficient p-value estimation in massively parallel testing problems
- The suboptimality of randomized tests in distributed and quantized detection systems
- Asymptotic Optimality of Running Consensus in Testing Binary Hypotheses
- A toolbox for refined information-theoretic analyses
This page was built for publication: On the Optimality of Binning for Distributed Hypothesis Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989728)