collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2026

An Orthogonal Approximate Message Passing Framework for Multiuser Communications

Burak Çakmak, Hao Yan, Alexander Fengler +2

We solve the open problem of constructing a Bayes-optimal iterative signal recovery algorithm for linear-Gaussian \emph{multiuser} communication systems with random precoding at th…

cs.IT2026

Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys

Xiang Zhang, Han Yu, Zhou Li +2

Information-theoretic topological secure aggregation (TSA)\cite{zhang2026information_regular} enables distributed users to compute neighborhood sums over arbitrary networks without…

cs.IT2026

Reducing Subpacketization in Device-to-Device Coded Caching via Heterogeneous File Splitting

Xiang Zhang, Giuseppe Caire, Mingyue Ji

The packet type (PT)-based framework~\cite{zhang2026taming} provides a systematic and principled approach to designing device-to-device (D2D) coded caching schemes that achieve red…

cs.IT2026

On the Fundamental Limits of Hierarchical Secure Aggregation with Dropout and Collusion Resilience

Zhou Li, Yizhou Zhao, Xiang Zhang +1

We study the fundamental communication limits of information-theoretic secure aggregation in a hierarchical network consisting of a server, multiple relays, and multiple users per…

cs.IT2024

Joint Message Detection, Channel, and User Position Estimation for Unsourced Random Access in Cell-Free Networks

Eleni Gkiouzepi, Burak Çakmak, Manfred Opper +1

We consider unsourced random access (uRA) in user-centric cell-free (CF) wireless networks, where random access users send codewords from a common codebook during specifically dedi…