|Strong Converse for Testing Against Independence over a Noisy channel
|Sreejith Sreekumar, Deniz Gunduz, Imperial College London, United Kingdom
|E.6: Hypothesis Testing II
|Detection and Estimation
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|A distributed binary hypothesis testing (HT) problem over a noisy (discrete and memoryless) channel studied previously by the authors is investigated from the perspective of the strong converse property. It was shown by Ahlswede and Csiszar that a strong converse holds in the above setting when the channel is rate-limited and noiseless. Motivated by this observation, we show that the strong converse continues to hold in the noisy channel setting for a special case of HT known as testing against independence (TAI), under the assumption that the channel transition matrix has non-zero elements. The proof utilizes the blowing up lemma and the recent change of measure technique of Tyagi and Watanabe as the key tools.