Distributed matrix computations - matrix-matrix or matrix-vector multiplications are well-recognized to suffer from the problem of stragglers (slow failed worker nodes). Much prior work in this area is (i) either sub-optimal terms its straggler resilience, (ii) suffers numerical problems, i.e., there a blow-up round-off errors decoded result owing high condition numbers corresponding decoding m...

Motivated by the design of low-complexity distributed quantizers and iterative decoding algorithms that leverage the correlation in the data picked up by a large-scale sensor network, we address the problem of finding correlation preserving clusters. To construct a factor graph describing the statistical dependencies between sensor measurements, we develop a hierarchical clustering algorithm th...

We show a reduction method to construct a code for the Gray-Wyner (GW) network from a given code for the Wyner-Ahlswede-Körner (WAK) network. By combining this reduction with a converse bound on the GW network, we derive a converse bound on the WAK network. The derived bound gives an alternative proof of the strong converse theorem for the WAK network.

We introduce a distributed source coding scheme called successive Wyner-Ziv coding scheme. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive Wyner-Ziv coding. The notion of successive refinement in the single source coding is generalized to the distributed source coding scenario, which we refer to as distributed successive refinem...

Inspired by a recently proposedconstructive framework for the distributed source coding problem [1], we propose a powerful constructive approach to the watermarking problem, emphasizing the dual roles of distributed source coding with side information at the decoder and channel coding with side information at the encoder. In our framework, we explore various source and channel codes to close th...