activity
20182022
collaborators
Showing 2019Show all

5 papers · 1 filter

cs.IT2019

Non-adaptive Quantitative Group Testing Using Irregular Sparse Graph Codes

Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh +2

This paper considers the problem of Quantitative Group Testing (QGT) where there are some defective items among a large population of items. We consider the scenario in which e…

cs.IT2019

Private Information Retrieval with Private Coded Side Information: The Multi-Server Case

Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh +1

In this paper, we consider the multi-server setting of Private Information Retrieval with Private Coded Side Information (PIR-PCSI) problem. In this problem, there is a database of…

cs.IT2019

Multi-Server Private Information Retrieval with Coded Side Information

Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh +1

In this paper, we study the multi-server setting of the \emph{Private Information Retrieval with Coded Side Information (PIR-CSI)} problem. In this problem, there are messages…

cs.IT2019

Single-Server Single-Message Online Private Information Retrieval with Side Information

Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh +1

In many practical settings, the user needs to retrieve information from a server in a periodic manner, over multiple rounds of communication. In this paper, we discuss the setting…

cs.IT2019

Sparse Graph Codes for Non-adaptive Quantitative Group Testing

Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh +2

This paper considers the problem of Quantitative Group Testing (QGT). Consider a set of items among which items are defective. The QGT problem is to identify (all or a suff…