Distributed information-theoretic biclustering of two memoryless sources

Abstract : A novel multi-terminal source coding problem motivated by biclustering applications is investigated. In this setting, two separate encoders observe two dependent memoryless processes Xn and Zn, respectively. The encoders' goal is to find rate-limited functions f(Xn) and g(Zn) that maximize asymptotically the mutual information I(f(Xn); g(Zn)) ≥ nμ. We derive non-trivial inner and outer bounds on the optimal characterization of the achievable rates for this problem. Applications also arise in the context of distributed hypothesis testing against independence under communication constraints.
Complete list of metadatas

Contributor : Pablo Piantanida <>
Submitted on : Sunday, January 17, 2016 - 10:34:45 PM
Last modification on : Thursday, November 22, 2018 - 1:16:01 PM



Pichler Georg, Pablo Piantanida, Gerald Matz. Distributed information-theoretic biclustering of two memoryless sources. 53rd Annual Allerton Conference on Communication, Control, and Computing, Sep 2015, Monticello, USA, United States. ⟨10.1109/allerton.2015.7447035 ⟩. ⟨hal-01257609⟩



Record views