On the Necessity of Binning for the Distributed Hypothesis Testing Problem

Abstract : A distributed hypothesis testing (HT) problem is considered, comprising two nodes and a unidirectional communication link. The receiving node is required to make a decision as to the probability distribution in effect. A binning process is used in order to minimize the probability of error, resulting in a new achievable error-exponent. A sub-class of HT problems with general hypotheses is defined, which contains many interesting and relevant problems. The advantage of the binning strategy in comparison to the non-binning approach is demonstrated by means of a binary symmetric example
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

Contributor : Matha Deghel <>
Submitted on : Monday, December 14, 2015 - 2:40:54 PM
Last modification on : Monday, December 17, 2018 - 2:28:01 PM
Long-term archiving on : Saturday, April 29, 2017 - 12:57:21 PM


Explicit agreement for this submission



Gil Katz, Pablo Piantanida, Romain Couillet, Merouane Debbah. On the Necessity of Binning for the Distributed Hypothesis Testing Problem. IEEE International Symposium on Information Theory, Jun 2015, hong kong, Hong Kong SAR China. ⟨10.1109/isit.2015.7282966 ⟩. ⟨hal-01242524⟩



Record views


Files downloads