信息论
This paper studies the active intelligent reflecting surface (IRS)-enabled integrated sensing and communications (ISAC), in which an active IRS is deployed to assist the base station (BS) in serving multiple communication users (CUs) and…
Consider the problem of computing quantized linear functions with only a few queries. Formally, given $\mathbf{x}\in \mathbb{R}^k$, our goal is to encode $\mathbf{x}$ as $\mathbf{c} \in \mathbb{R}^n$, for $n > k$, so that for any…
We study the channel resolvability problem, which is used to prove strong converse of identification via channel. Channel resolvability has been solved by only random coding in the literature. We prove channel resolvability using the…
In practice, low Earth orbit (LEO) and medium Earth orbit (MEO) satellite networks consist of multiple orbits which are populated with many satellites. A widely used spatial architecture for LEO or MEO satellites is the Walker…
We suggest a re-examination of the conventional view that hybrid optical-radio frequency (O-RF) systems are primarily diversity-driven networks that switch between RF and optical links for robustness. Instead, we uncover a new architectural…
As satellite communications play an increasingly important role in future wireless networks, the issue of limited link budget in satellite systems has attracted significant attention in current research. Although semantic communications…
In this paper, we propose to exploit movable elements of intelligent reflecting surface (IRS) to enhance the overall performance of integrated sensing and communication (ISAC) systems. Firstly, focusing on a single-user scenario, we reveal…
Having established that Zadoff-Chu (ZC) sequences are inherently linear micro-frequency hopping (lmFH) symbols, this paper first presents an intuitive and visual exposition of the computation of the DFT and IDFT of ZC sequences using the…
Jalali and Poor introduced an asymptotic framework for compressed sensing of stochastic processes, demonstrating that any rate strictly greater than the mean information dimension serves as an upper bound on the number of random linear…
Traditional low-power wide-area network (LPWAN) transceivers typically compromise data rates to achieve deep coverage. This paper presents a novel transceiver that achieves high receiver sensitivity and low computational complexity. At the…
In 1969 J. Verhoeff provided the first examples of a decimal error detecting code using a single check digit to provide protection against all single, transposition and adjacent twin errors. The three versions of such a code that he…
This paper employs the add-and-subtract technique of the auxiliary receiver approach to establish a new upper bound for the distributed hypothesis testing problem. This new bound has fewer assumptions than the upper bound proposed by Rahman…
We consider the problem of reconstructing an undirected graph $G$ on $n$ vertices given multiple random noisy subgraphs or "traces". Specifically, a trace is generated by sampling each vertex with probability $p_v$, then taking the…
With the dawn of AI factories ushering a new era of computing supremacy, development of strategies to effectively track and utilize the available computing resources is garnering utmost importance. These computing resources are often…
Decentralized exchange platforms such as Uniswap and Balancer operate on several pools where each pool contains two or more cryptocurrencies and constitutes direct trading pairs. The drawbacks here are that liquidity providing requires…
Mimicking the idea of the generalized Hamming weight of linear codes, we introduce a new lattice invariant, the generalized theta series. Applications range from identifying stable lattices to the lattice isomorphism problem. Moreover, we…
Orthogonal delay-Doppler division multiplexing (ODDM) modulation offers a promising solution to the problem of severe Doppler effects in low earth orbit (LEO) satellites communications. It has been suggested in the recent literature that…
We present novel constructions of polynomial codes for private distributed matrix multiplication (PDMM/SDMM) using outer product partitioning (OPP). We extend the degree table framework from the literature to cyclic-addition degree tables…
The domain-independent universal Normalized Information Distance based on Kolmogorov complexity has been (in approximate form) successfully applied to a variety of difficult clustering problems. In this paper we investigate theoretical…
The optimization of the \gls{pdpr} is a recourse that helps wireless systems to acquire channel state information while minimizing the pilot overhead. While the optimization of the \gls{pdpr} in cellular networks has been studied…