On the Necessity of Binning for the Distributed Hypothesis Testing Problem

Gil Katz (1) , Pablo Piantanida (1) , Romain Couillet (1) , Merouane Debbah (2, 3)

1 L2S - Laboratoire des signaux et systèmes
2 LANEAS - Large Networks and Systems Group
3 Mathematical and Algorithmic Sciences Lab [Paris]

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

Domaines: Mathématiques [math]; Sciences de l'ingénieur [physics]; Statistiques [stat]

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⟩