activity
20092018
most citedNon-existence of certain kind of finite-letter mutual information characterization for a class of time-invariant Markoff channels

5 citations · 9 across the 10 of their papers we have counts for

collaborators

10 papers

cs.IT2018

Source-channel separation for two-way interactive communication with fidelity criteria

Mukul Agarwal

Consider the channel coding problem where two users are interacting in order to communicate an i.i.d. source X1 from User 1 to User 2 with distortion D1 and an i.i.d. source X2 fro…

cs.IT2018★ 5 cited

Non-existence of certain kind of finite-letter mutual information characterization for a class of time-invariant Markoff channels

Mukul Agarwal

We provide a rigorous definition of a certain kind of characterization for capacity regions of a family of Markoff networks which is based on optimization problems resulting out of…

cs.IT2018

Rate-distortion functions of non-stationary Markoff chains and their block-independent approximations

Mukul Agarwal

It is proved that the limit of the normalized rate-distortion functions of block independent approximations of an irreducible, aperiodic Markoff chain is independent of the initial…

cs.IT2017

PSPACE hardness of approximating the capacity of Markoff channels with noiseless feedback

Mukul Agarwal

It will be proved that computing the capacity of a Markoff channel with noiseless feedback is PSPACE-hard.

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.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…

cs.IT2009

Equivalence perspectives in communication, source-channel connections and universal source-channel separation

Mukul Agarwal, Anant Sahai, Sanjoy Mitter

An operational perspective is used to understand the relationship between source and channel coding. This is based on a direct reduction of one problem to another that uses random…