Distributed information-theoretic biclustering

Abstract : We study a novel multi-terminal source coding setup motivated by the biclustering problem. Two separate encoders observe two stationary, memoryless sources Xn and Zn, respectively. The goal is to find rate-limited encodings f(xn) and g(zn) that maximize the mutual information I(f(Xn);g(Zn))/n. We present non-trivial outer and inner bounds on the achievable region for this problem. These bounds are also generalized to an arbitrary collection of stationary, memoryless sources. The considered problem is intimately connected to distributed hypothesis testing against independence under communication constraints, and hence our results are expected to apply to that setting as well.
Complete list of metadatas

Contributor : Pablo Piantanida <>
Submitted on : Monday, January 16, 2017 - 4:53:14 PM
Last modification on : Thursday, November 22, 2018 - 1:16:01 PM

Links full text


  • HAL Id : hal-01436774, version 1
  • ARXIV : 1602.04605


Pichler Georg, Pablo Piantanida, Gerald Matz. Distributed information-theoretic biclustering. 2016. ⟨hal-01436774⟩



Record views