[Back]

G. Pichler, P. Piantanida, G. Matz:
"Distributed Information-Theoretic Biclustering of Two Memoryless Sources";
Talk: Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA; 2015-09-30 - 2015-10-02; in: "Proceedings of the 53rd Annual Allerton Conference on Communication, Control, and Computing", IEEE (ed.); (2015).

A novel multi-terminal source coding problem motivated by biclustering applications is investigated. In this setting, two separate encoders observe two dependent memoryless processes X^n and Z^n, respectively. The encoders' goal is to find rate-limited functions f(X^n) and g(Z^n) that maximize asymptotically the mutual information I(f(X^n); g(Z^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.

Information Theory, Source Coding and Compression, Detection and Estimation

http://publik.tuwien.ac.at/files/PubDat_241951.pdf