Zobrazeno 1 - 10
of 715
pro vyhledávání: '"Jafar, Syed"'
In this paper, we consider a K-user interference channel where interference among the users is neither too strong nor too weak, a scenario that is relatively underexplored in the literature. We propose a novel deep learning-based approach to design t
Externí odkaz:
http://arxiv.org/abs/2407.15054
Autor:
Yao, Yuhang, Jafar, Syed A.
The $N$-sum box protocol specifies a class of $\mathbb{F}_d$ linear functions $f(W_1,\cdots,W_K)=V_1W_1+V_2W_2+\cdots+V_KW_K\in\mathbb{F}_d^{m\times 1}$ that can be computed at information theoretically optimal communication cost (minimum number of q
Externí odkaz:
http://arxiv.org/abs/2407.01498
Blind Interference Alignment for MapReduce: Exploiting Side-information with Reconfigurable Antennas
Autor:
Lu, Yuxiang, Jafar, Syed A.
In order to explore how blind interference alignment (BIA) schemes may take advantage of side-information in computation tasks, we study the degrees of freedom (DoF) of a $K$ user wireless network setting that arises in full-duplex wireless MapReduce
Externí odkaz:
http://arxiv.org/abs/2404.09141
Autor:
Yao, Yuhang, Jafar, Syed A.
The optimal quantum communication cost of computing a classical sum of distributed sources is studied over a quantum erasure multiple access channel (QEMAC). K classical messages comprised of finite-field symbols are distributed across $S$ servers, w
Externí odkaz:
http://arxiv.org/abs/2311.08386
Autor:
Lu, Yuxiang, Jafar, Syed A.
Building on recent constructions of Quantum Cross Subspace Alignment (QCSA) codes, this work develops a coding scheme for QEBXSTPIR, i.e., classical private information retrieval with $X$-secure storage and $T$-private queries, over a quantum multipl
Externí odkaz:
http://arxiv.org/abs/2311.07829
Inspired by recent work by Christensen and Popovski on secure $2$-user product computation for finite-fields of prime-order over a quantum multiple access channel, the generalization to $K$ users and arbitrary finite fields is explored. Asymptoticall
Externí odkaz:
http://arxiv.org/abs/2305.20073
Autor:
Yao, Yuhang, Jafar, Syed A.
The $\Sigma$-QMAC problem is introduced, involving $S$ servers, $K$ classical ($\mathbb{F}_d$) data streams, and $T$ independent quantum systems. Data stream ${\sf W}_k, k\in[K]$ is replicated at a subset of servers $\mathcal{W}(k)\subset[S]$, and qu
Externí odkaz:
http://arxiv.org/abs/2305.03122
Autor:
Lu, Yuxiang, Jafar, Syed Ali
Cross-subspace alignment (CSA) codes are used in various private information retrieval (PIR) schemes (e.g., with secure storage) and in secure distributed batch matrix multiplication (SDBMM). Using a recently developed $N$-sum box abstraction of a qu
Externí odkaz:
http://arxiv.org/abs/2304.14676