activity
20062022
most citedSemidefinite Programming Approach to Gaussian Sequential Rate-Distortion Trade-offs

117 citations · 238 across the 19 of their papers we have counts for

collaborators
Showing cs.ITShow all

11 papers · 1 filter

cs.IT2017

Layered black-box, behavioral interconnection perspective and applications to the problem of communication with fidelity criteria, Part II: stationary sources satisfying ψ-mixing criterion

Mukul Agarwal, Sanjoy Mitter, Anant Sahai

Theorems from Part 1 of this paper are generalized to ψ-mixing sources in this paper. Application to Markoff chains and order m Markoff chains is presented. The main result is the…

cs.IT2017

Layered black-box, behavioral interconnection perspective and applications to the problem of communication with fidelity criteria, Part I: i.i.d. sources

Mukul Agarwal, Sanjoy Mitter, Anant Sahai

In this paper, the problem of communication over an essentially unknown channel, which is known to be able to communicate a source to a destination to within a certain distortion l…

cs.IT2015

A randomized covering-packing duality between source-coding and channel-coding

Mukul Agarwal, Sanjoy MItter

A randomized covering-packing duality between source and channel coding will be discussed by considering the source coding problem of coding a source with a certain distortion leve…

cs.IT2013★ 4 cited

A universal, operational theory of unicast multi-user communication with fidelity criteria

Mukul Agarwal, Sanjoy Mitter, Anant Sahai

This is a three part paper. Optimality of source-channel separation for communication with a fidelity criterion when the channel is compound as defined by Csiszar and Korner in the…

cs.IT2011★ 19 cited

Channels That Die

Lav R. Varshney, Sanjoy K. Mitter, Vivek K Goyal

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-s…

cs.IT2010

Architecture for communication with a fidelity criterion in unknown networks

Mukul Agarwal, Sanjoy Mitter

We prove that in order to communicate independent sources (this is the unicast problem) between various users over an unknown medium to within various distortion levels, it is suff…