Binary distributed hypothesis testing via Körner-Marton coding

Eli Haim, Yuval Kochman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

We consider the problem of distributed binary hypothesis testing of two sequences that are generated by a doubly binary symmetric source. Each sequence is observed by a different terminal. The two hypotheses correspond to different levels of correlation between the two source components, i.e., the i.i.d. probability of the difference between the two sequences. The terminals communicate with a decision function via equal-rate noiseless links. We analyze the tradeoff between the exponential decay of the error probabilities of the hypothesis test and the communication rate. As Körner-Marton coding is known to minimize the rate in the corresponding distributed compression problem of conveying the difference sequence, it constitutes a natural candidate for the present setting. Indeed, using this scheme we derive achievable error exponents. Interestingly, these coincide with part of the optimal tradeoff without communication constraints, even when the rate is below the Körner-Marton rate for one of the hypotheses.

Original languageAmerican English
Title of host publication2016 IEEE Information Theory Workshop, ITW 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages146-150
Number of pages5
ISBN (Electronic)9781509010905
DOIs
StatePublished - 21 Oct 2016
Event2016 IEEE Information Theory Workshop, ITW 2016 - Cambridge, United Kingdom
Duration: 11 Sep 201614 Sep 2016

Publication series

Name2016 IEEE Information Theory Workshop, ITW 2016

Conference

Conference2016 IEEE Information Theory Workshop, ITW 2016
Country/TerritoryUnited Kingdom
CityCambridge
Period11/09/1614/09/16

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Fingerprint

Dive into the research topics of 'Binary distributed hypothesis testing via Körner-Marton coding'. Together they form a unique fingerprint.

Cite this