activity
20092026
most citedNetwork Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes

9 citations · 43 across the 41 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

cs.IT2018★ 5 cited

On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information

Anoosheh Heidarzadeh, Brenden Garcia, Swanand Kadhe +2

We study Private Information Retrieval with Side Information (PIR-SI) in the single-server multi-message setting. In this setting, a user wants to download messages from a data…

cs.IT2018

Capacity of Single-Server Single-Message Private Information Retrieval with Coded Side Information

Anoosheh Heidarzadeh, Fatemeh Kazemi, Alex Sprintson

This paper considers the problem of single-server single-message private information retrieval with coded side information (PIR-CSI). In this problem, there is a server storing a d…

cs.IT2018★ 5 cited

A Systematic Approach to Incremental Redundancy over Erasure Channels

Anoosheh Heidarzadeh, Jean-Francois Chamberland, Parimal Parag +1

As sensing and instrumentation play an increasingly important role in systems controlled over wired and wireless networks, the need to better understand delay-sensitive communicati…

cs.IT2018

A Simple and Efficient Strategy for the Coin Weighing Problem with a Spring Scale

Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh +1

This paper considers a generalized version of the coin weighing problem with a spring scale that lies at the intersection of group testing and compressed sensing problems. Given a…

cs.IT2018

A Monetary Mechanism for Stabilizing Cooperative Data Exchange with Selfish Users

Anoosheh Heidarzadeh, Ishan Tyagi, Srinivas Shakkottai +1

This paper considers the problem of stabilizing cooperative data exchange with selfish users. In this setting, each user has a subset of packets in the ground set , and wants al…