信息论
This paper presents a novel wireless sensing system where a movable antenna (MA) continuously moves and receives sensing signals within a three-dimensional (3-D) region to enhance sensing performance compared with conventional…
Network Coding (NC) is a compelling solution for increasing network efficiency. However, it discards corrupted packets and cannot achieve optimal performance in noisy communications. Since most of the information in corrupted packets is…
Belief-propagation (BP) decoding for quantum low-density parity-check (QLDPC) codes is appealing due to its low complexity, yet it often exhibits convergence issues due to quantum degeneracy and short cycles that exist in the Tanner graph.…
In 2004, while studying the information geometry of binary Bayesian networks (bitnets), the author conjectured that the volume-averaged Ricci scalar <R> computed with respect to the Fisher information metric is universally quantized to…
We study the problem of differentially private (DP) secure multiplication in distributed computing systems, focusing on regimes where perfect privacy and perfect accuracy cannot be simultaneously achieved. Specifically, N nodes…
Channel decoding is a challenging task in communication channels exhibiting memory effects. In this work, we apply the recently proposed decoding paradigm of guessing random additive noise decoding (GRAND) to channels with memory, focusing…
Within the Guessing Random Additive Noise Decoding (GRAND) family, ordered reliability bits GRAND (ORBGRAND) has received considerable attention for its hardware-friendly exploitation of soft information. Existing information-theoretic…
We show that it can be suboptimal for Bayesian decision-making agents employing social learning to use correct prior probabilities as their initial beliefs. We consider sequential Bayesian binary hypothesis testing where each individual…
We show that social learning is not useful in a model of team binary decision making by voting, where each vote carries equal weight. Specifically, we consider Bayesian binary hypothesis testing where agents have any…
Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractability, and wide applicability in optimization and statistical…
Since Shannon's foundational work, rate-distortion theory has defined the fundamental limits of lossy compression. Classical results, derived for memoryless and stationary ergodic sources in the asymptotic regime, have shaped both transform…
We establish the randomized distributed function computation (RDFC) framework, in which a sender transmits just enough information for a receiver to generate a randomized function of the input data. Describing RDFC as a form of semantic…
During the Foundations of Future Communication Systems (FFCS) conference in Braunschweig, a dedicated memorial session was held in honor of Dr. Vladimir (Volodya) Sidorenko (1949-2025). The session, chaired by Minglai Cai, brought together…
Artificial noise (AN) is a key physical-layer security scheme for wireless communications over multiple-input multiple-output wiretap channels. Recently, artificial noise elimination (ANE) has emerged as a strategy to mitigate the impact of…
In ambient backscatter communication (AmBC), strong direct interference from the ambient source poses a major challenge to reliable symbol detection. Although previous studies have shown that employing a low-noise amplifier (LNA) in…
Analog joint source-channel coding (JSCC) has demonstrated superior performance for semantic communications through graceful degradation across channel conditions. However, a fundamental hardware-software mismatch prevents deployment on…
Zero-knowledge codes, introduced by Decatur, Goldreich, and Ron (ePrint 1997), are error-correcting codes in which few codeword symbols reveal no information about the encoded message, and have been extensively used in cryptographic…
We study a class of finite-state channels, known as POST channels, in which the previous channel output serves as the current state. A POST channel is deemed approximately memoryless when the state-dependent transition matrices are…
BCH and LCD cyclic codes of length $n=\lambda(q^m+1)$ with $\lambda\mid q-1$ are studied. A complete characterization of $q$-cyclotomic cosets modulo $n$ is given: Theorem \ref{th4} provides a necessary and sufficient condition for any…
Rate-Splitting Multiple Access (RSMA) is a key enabling technique for sixth-generation (6G) wireless systems due to its powerful interference management, and Reconfigurable Intelligent Surface (RIS) improves communication performance by…