On Sub-optimality of Random Binning for Distributed Hypothesis Testing

2022/01/31 by Watanabe, Shun · 2 citations
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2201.13005

Abstract

We investigate the quantize and binning scheme, known as the Shimokawa-Han-Amari (SHA) scheme, for the distributed hypothesis testing. We develop tools to evaluate the critical rate attainable by the SHA scheme. For a product of binary symmetric double sources, we present a sequential scheme that improves upon the SHA scheme.

Cited by

• Multi-Sensor Distributed Hypothesis Testing in the Low-Power Regime
• Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing

Related

• Improved Random-Binning Exponent for Distributed Hypothesis Testing
• Optimality of Binning for Distributed Hypothesis Testing
• An Information-Spectrum Approach to Distributed Hypothesis Testing for General Sources
• Covering Codes as Near-Optimal Quantizers for Distributed Testing Against Independence
• Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing