activity
20092026
most citedInner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results

64 citations · 466 across the 78 of their papers we have counts for

collaborators
Showing 2016 · cs.ITShow all

6 papers · 2 filters

cs.IT2016

Novel Delivery Schemes for Decentralized Coded Caching in the Finite File Size Regime

Kai Wan, Daniela Tuninetti, Pablo Piantanida

This paper analyzes the achievable tradeoff between cache~size and download~rate in decentralized caching systems with the uncoded cache placement originally proposed by Maddah-Ali…

cs.IT2016

On the Minimum Mean -th Error in Gaussian Noise Channels and its Applications

Alex Dytso, Ronit Bustin, Daniela Tuninetti +3

The problem of estimating an arbitrary random vector from its observation corrupted by additive white Gaussian noise, where the cost function is taken to be the Minimum Mean -th…

cs.IT2016★ 2 cited

Network Simplification in Half-Duplex: Building on Submodularity

Martina Cardone, Yahya H. Ezzeldin, Christina Fragouli +1

This paper explores the {\it network simplification} problem in the context of Gaussian Half-Duplex (HD) diamond networks. Specifically, given an -relay diamond network, this pr…

cs.IT2016

On Communication through a Gaussian Channel with an MMSE Disturbance Constraint

Alex Dytso, Ronit Bustin, Daniela Tuninetti +3

This paper considers a Gaussian channel with one transmitter and two receivers. The goal is to maximize the communication rate at the intended/primary receiver subject to a disturb…

cs.IT2016

On Caching with More Users than Files

Kai Wan, Daniela Tuninetti, Pablo Piantanida

Caching appears to be an efficient way to reduce peak hour network traffic congestion by storing some content at the user's cache without knowledge of later demands. Recently, Madd…

cs.IT2016★ 1 cited

On Network Simplification for Gaussian Half-Duplex Diamond Networks

Martina Cardone, Christina Fragouli, Daniela Tuninetti

This paper investigates the simplification problem in Gaussian Half-Duplex (HD) diamond networks. The goal is to answer the following question: what is the minimum (worst-case) fra…