信息论

Accurate channel knowledge is critical in massive multiple-input multiple-output (MIMO), which motivates the use of channel prediction. Machine learning techniques for channel prediction hold much promise, but current schemes are limited in…

Conventional multiple-input multiple-output (MIMO) systems mainly rely on fixed antenna arrays, which limits their capability to adapt the effective channel matrix to the propagation environment. Rotatable antennas (RAs), which enable…

The implementation of the \ac{isac} feature in \ac{6g} networks is most likely to be based on the framework of \ac{ofdm}. Input distribution design, or constellation design, is a crucial technique in \ac{ofdm}-\ac{isac} systems enabling a…

In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over $\mathbb{Z}/q_1\mathbb{Z} \times \cdots \times \mathbb{Z}/q_n\mathbb{Z}$ and derive a Singleton-like bound for…

We show that if the conditional distribution p(C | T) factors through a sufficient statistic {\phi}(T), then the Information Bottleneck (IB) problem for (T, C) is exactly equivalent to the IB problem for ({\phi}(T), C). The reduction is…

In the Internet-of-Things (IoT) era, efficient functionality integration is essential to address the growing demands of communication, computation, and sensing. Signal-level integrated sensing, computing, and communication (Sig-ISCC) is…

Received Signal Strength Indicator (RSSI) estimation is essential for wireless link management, yet conventional feedback-based approaches incur uplink overhead, suffer from measurement instability, and are subject to inherent feedback loop…

Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives strictly stronger protection than the data, such a code is called…

We study the fundamental limits of multi-server secure aggregation over a two-hop network where multiple servers, each connected to a disjoint subset of users, jointly compute the sum of all users' inputs. The goal is to ensure that no…

The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. In the realm of sequence design,…

We study the hierarchical secure aggregation problem with groupwise keys. The problem consists of an aggregation server, $U$ relays, and $UV$ users, where each relay serves $V$ disjoint users, and each subset of $G$ users shares an…

Movable antennas (MAs) have attracted growing interest for their ability to improve channel conditions via adaptive antenna movement. Nevertheless, such movement inevitably introduces mutual coupling (MC), whose impact has been largely…

In the context of quantum secure scenarios, existing research on mobile edge devices and intelligent computing and edge (ICE) systems based on the Non-Orthogonal Multiple Access (NOMA) communication model have overlooked the energy…

This paper presents a semantic-enhanced receiver framework for transmitting natural language sentences over noisy wireless channels using multiple short block codes. After ASCII encoding, the sentence is divided into segments, each…

We study pricing mechanisms for low-latency payload delivery in settings where participant rewards depend on the time required to reconstruct a payload. In such environments, the decoding time distribution determines deadline-meeting…

Codes which have a finite field $\mathbb{F}_{q^m}$ as their alphabet but which are only linear over a subfield $\mathbb{F}_q$ are a topic of much recent interest due to their utility in constructing quantum error correcting codes. In this…

The achievement of spectral super-resolution sensing is critically important for a variety of applications, such as radar, remote sensing, and wireless communication. However, in compressed spectrum sensing, challenges such as spectrum…

We investigate a natural subfamily of twisted linearized Reed--Solomon (TLRS) codes in the sum-rank metric, where the twist is applied only to the constant term. We establish a simple necessary and sufficient condition for these codes to be…

For the polar codes introduced by Arikan in 2009, the first code family achieving the capacity of binary-input discrete memoryless channels (BIDMCs) with low-complexity encoding and decoding, it is crucial to evaluate the reliability of the…

State-dependent bipartite networks with state-cognizant receivers and state-informed transmitters are studied. Such networks have no nodes that both transmit and receive. Examples are the multi-access channel, the broadcast channel, and the…