activity
20082018
most citedTwo Unicast Information Flows over Linear Deterministic Networks

1 citations · 1 across the 2 of their papers we have counts for

collaborators

6 papers

cs.IT2018

An Operational Approach to Information Leakage

Ibrahim Issa, Aaron B. Wagner, Sudeep Kamath

Given two random variables and , an operational approach is undertaken to quantify the ``leakage'' of information from to . The resulting measure $\mathcal{L}(X \!\!…

cs.IT2015

The two-unicast problem

Sudeep Kamath, Venkat Anantharam, David Tse +1

We consider the communication capacity of wireline networks for a two-unicast traffic pattern. The network has two sources and two destinations with each source communicating a mes…

cs.IT2015

On Non-Interactive Simulation of Joint Distributions

Sudeep Kamath, Venkat Anantharam

We consider the following non-interactive simulation problem: Alice and Bob observe sequences and respectively where are drawn i.i.d. from $P(x…

cs.IT2013

On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover

Venkat Anantharam, Amin Gohari, Sudeep Kamath +1

In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-Rényi maximal correlation of a pair of random , as well as of the chordal slope of the n…

cs.IT2011★ 1 cited

Two Unicast Information Flows over Linear Deterministic Networks

I-Hsiang Wang, Sudeep U. Kamath, David N. C. Tse

We investigate the two unicast flow problem over layered linear deterministic networks with arbitrary number of nodes. When the minimum cut value between each source-destination pa…

cs.IT2008

On Distributed Function Computation in Structure-Free Random Networks

Sudeep Kamath, D. Manjunath

We consider in-network computation of MAX in a structure-free random multihop wireless network. Nodes do not know their relative or absolute locations and use the Aloha MAC protoco…