Information Theory Papers of the Week

This paper investigates non-asymptotic achievable rate regions of Gaussian multiple-access channels (MACs) and broadcast channels (BCs) in the finite-blocklength regime.

In this work, we investigate the impact of Doppler frequency shift on sub-terahertz low Earth orbit (LEO) satellite communications using OFDM transmission.

Building on an extreme-value-theory/kernel-density-estimation (EVT/KDE) predictor with quantile-defined interference states, this paper makes the predictor resilient to unannounced shifts in the interference distribution.

For classical-quantum multiple access channels (cq-MACs) with two senders, we give several general expressions for the capacity region, valid for arbitrary sequences of channels.

We consider private retrieval of the matrix product $A^\top B^{(\theta)}$ from replicated $P_c$-colluding servers when $B^{(\ell)}=A+N^{(\ell)}$, with the innovations mutually independent and independent of the user-held $A\in\mathbb{F}_q^{m\times m}$.

We develop an alternating optimization algorithm, combining an exact principal-eigenvector beamforming solution with feasible SCA-based projected gradient position updates.

This study characterizes the genetic features of HIV-1 populations within blood-derived reservoirs of LoViReT individuals.

In this work, we consider MiLAC implementations based on LC resonators with tunable capacitance, which allow synthesizing near-arbitrary passive lossless impedance matrices at individual frequencies using inductors and varactors.

In this paper, we develop an NCOTA consensus framework that accommodates row-stochastic mixing, without requiring the conventional average-preservation property of doubly stochastic mixing matrices.

In this paper, we propose a novel belief-driven stealthy jammer UAV detection scheme from the perspective of Bayesian security game.

We prove that any linear $3$-query locally correctable code $C \colon \mathbb{F}_2^k \to \mathbb{F}_2^n$ with constant correction radius must have length $n \geq 2^{\Omega(\sqrt{k})}$.

We study when the regularized value is attained at finite blocklength and how efficiently it can be approximated.

We determine the information complexity of matrix multiplication over finite fields under independent uniform inputs, up to a universal additive constant.

This paper proposes XGB-SVD, a lightweight hybrid precoding framework that maps compact ray-tracing path parameters directly to analog beamforming codeword indices using cascade eXtreme Gradient Boosting (XGBoost).

However, traditional communication systems suffer from insufficient semantic extraction and limited noise suppression capability. To address these issues, we propose a Speech enhancement-based Deep Semantic Autoencoder (S-DSA) communication system for wireless communications.

This paper defines unique institutional configurations in various countries according to six V-Dem democracy dimensions, including the Liberal Democracy Index, Electoral Democracy Index, Liberal Component Index, Egalitarian Component Index, Participatory Component Index, and Deliberative Component Index.

We prove a fixed-characteristic density form of the Berger-Charpin conjecture for non-degenerate irreducible cyclic codes: for each prime $p$, the lengths admitting such a non-standard code over some finite field of characteristic $p$ have natural density zero.

We prove that the covering radius of the third-order Reed--Muller code in eight variables is fifty-six.

To this end, we introduce a capped Horvitz--Thompson estimator with uniformly bounded discrete derivatives on the $p$-biased cube.