Search Results - "Jafar, Syed Ali"
-
1
Optimal relay functionality for SNR maximization in memoryless relay networks
Published in IEEE journal on selected areas in communications (01-02-2007)“…We explore the SNR-optimal relay functionality in a mernoryless relay network, i.e. a network where, during each channel use, the signal transmitted by a relay…”
Get full text
Journal Article -
2
The Capacity of Private Information Retrieval
Published in IEEE transactions on information theory (01-07-2017)“…In the private information retrieval (PIR) problem, a user wishes to retrieve, as efficiently as possible, one out of K messages from N non-communicating…”
Get full text
Journal Article -
3
The Capacity of Robust Private Information Retrieval With Colluding Databases
Published in IEEE transactions on information theory (01-04-2018)“…Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of <inline-formula> <tex-math notation="LaTeX">K…”
Get full text
Journal Article -
4
Interference Alignment and the Generalized Degrees of Freedom of the X Channel
Published in IEEE transactions on information theory (01-08-2012)“…We explore the capacity and generalized degrees of freedom (GDOF) of the two-user Gaussian X channel, i.e., a generalization of the two-user interference…”
Get full text
Journal Article -
5
The Capacity of Symmetric Private Information Retrieval
Published in IEEE transactions on information theory (01-01-2019)“…Private information retrieval (PIR) is the problem of retrieving, as efficiently as possible, one out of <inline-formula> <tex-math notation="LaTeX">K…”
Get full text
Journal Article -
6
Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al
Published in IEEE transactions on information theory (01-02-2018)“…A (K, N, T, K c ) instance of private information retrieval from MDS coded data with colluding servers (in short, MDS-TPIR), is comprised of K messages and N…”
Get full text
Journal Article -
7
The Capacity of T-Private Information Retrieval With Private Side Information
Published in IEEE transactions on information theory (01-08-2020)“…We consider the problem of <inline-formula> <tex-math notation="LaTeX">T </tex-math></inline-formula>-Private Information Retrieval with private side…”
Get full text
Journal Article -
8
X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers
Published in IEEE transactions on information theory (01-12-2020)“…The problem of <inline-formula> <tex-math notation="LaTeX">X </tex-math></inline-formula>-secure <inline-formula> <tex-math notation="LaTeX">T…”
Get full text
Journal Article -
9
The Capacity of Private Computation
Published in IEEE transactions on information theory (01-06-2019)“…We introduce the problem of private computation, comprised of N distributed and non-colluding servers, K independent datasets, and a user who wants to compute…”
Get full text
Journal Article -
10
Cross Subspace Alignment Codes for Coded Distributed Batch Computation
Published in IEEE transactions on information theory (01-05-2021)“…The goal of coded distributed computation is to efficiently distribute a computation task, such as matrix multiplication, <inline-formula> <tex-math…”
Get full text
Journal Article -
11
Topological Interference Management Through Index Coding
Published in IEEE transactions on information theory (01-01-2014)“…This paper studies linear interference networks, both wired and wireless, with no channel state information at the transmitters except a coarse knowledge of…”
Get full text
Journal Article -
12
Multiround Private Information Retrieval: Capacity and Storage Overhead
Published in IEEE transactions on information theory (01-08-2018)“…Private information retrieval (PIR) is the problem of retrieving one message out of <inline-formula> <tex-math notation="LaTeX">K </tex-math></inline-formula>…”
Get full text
Journal Article -
13
On the Capacity of Secure Distributed Batch Matrix Multiplication
Published in IEEE transactions on information theory (01-11-2021)“…The problem of secure distributed batch matrix multiplication (SDBMM) studies the communication efficiency of retrieving a sequence of desired matrix products…”
Get full text
Journal Article -
14
X-Secure T-Private Federated Submodel Learning With Elastic Dropout Resilience
Published in IEEE transactions on information theory (01-08-2022)“…Motivated by recent interest in federated submodel learning, this work explores the fundamental problem of privately reading from and writing to a database…”
Get full text
Journal Article -
15
Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length
Published in IEEE transactions on information forensics and security (01-12-2017)“…A private information retrieval (PIR) scheme is a mechanism that allows a user to retrieve any one out of K messages from N non-communicating replicated…”
Get full text
Journal Article -
16
The Asymptotic Capacity of Private Search
Published in IEEE transactions on information theory (01-08-2020)“…The private search problem is introduced, where a dataset comprised of <inline-formula> <tex-math notation="LaTeX">L </tex-math></inline-formula> i.i.d…”
Get full text
Journal Article -
17
On the Asymptotic Capacity of X-Secure T-Private Information Retrieval With Graph-Based Replicated Storage
Published in IEEE transactions on information theory (01-10-2020)“…The problem of private information retrieval with graph-based replicated storage was recently introduced by Raviv, Tamo and Yaakobi. Its capacity remains open…”
Get full text
Journal Article -
18
Sum-GDoF of Symmetric Multi-Hop Interference Channel Under Finite Precision CSIT Using Aligned-Images Sum-Set Inequalities
Published in IEEE transactions on information theory (01-07-2022)“…Aligned-Images Sum-set Inequalities are used in this work to study the Generalized Degrees of Freedom (GDoF) of the symmetric layered multi-hop interference…”
Get full text
Journal Article -
19
On the Capacity of Computation Broadcast
Published in IEEE transactions on information theory (01-06-2020)“…The two-user computation broadcast problem is introduced as the setting where User 1 wants message <inline-formula> <tex-math notation="LaTeX">W_{1}…”
Get full text
Journal Article -
20
On the Capacity of Locally Decodable Codes
Published in IEEE transactions on information theory (01-10-2020)“…A locally decodable code (LDC) maps <inline-formula> <tex-math notation="LaTeX">K </tex-math></inline-formula> source symbols, each of size <inline-formula>…”
Get full text
Journal Article