Fundamental structures and asymptotic performance criteria in decentralized binary hypothesis testing
From MaRDI portal
Recommendations
- Asymptotic Optimality Theory for Decentralized Sequential Multihypothesis Testing Problems
- Theoretical Bounds in Minimax Decentralized Hypothesis Testing
- Asymptotic optimality of likelihood ratio threshold tests in decentralized detection
- Asymptotic Optimality Theory for Decentralized Sequential Hypothesis Testing in Sensor Networks
- On the Optimality of Binning for Distributed Hypothesis Testing
- Decentralized Sequential Hypothesis Testing Using Asynchronous Communication
- On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection
- Distributed Hypothesis Testing Over Discrete Memoryless Channels
- A multistage procedure for decentralized sequential multi-hypothesis testing problems
- Decentralized Sequential Composite Hypothesis Test Based on One-Bit Communication
Cited in
(7)- Decentralized detection by a large number of sensors
- Robust decentralized detection by asymptotically many sensors
- Asymptotic Optimality Theory for Decentralized Sequential Hypothesis Testing in Sensor Networks
- Feedforward neural structures in binary hypothesis testing
- Asymptotic optimality of likelihood ratio threshold tests in decentralized detection
- Distributed Hypothesis Testing Based on Unequal-Error Protection Codes
- The implementation of dynamic rate allocation in sensor networks
This page was built for publication: Fundamental structures and asymptotic performance criteria in decentralized binary hypothesis testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2726614)