Theory & Algorithms · Computer Science & AI
Information Theory
The newest papers in Information Theory that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
474 papers, from 4 September 2026 to 5 November 2026: 474 arXiv preprints.
Get the few papers worth your time in Information Theory every morning.
Follow Information Theory and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 5
Localization MSE Analysis for Cooperative OFDM-ISAC
This paper develops a receiver-specific mean-squared-error (MSE) framework for cooperative integrated sensing and communication (ISAC) localization using random orthogonal frequency-division…Customizing Wireless Channels via Intelligent Reflecting Surfaces: Feasibility, Fundamental Limits, and Constructive Design
By adjusting their reflection coefficients, intelligent reflecting surfaces (IRSs) can reshape the channels between a base station (BS) and user equipment (UE).Fluid Antenna Array-Enabled Near-Field ISAC: Joint Port Position Optimization and Transmit Beamforming Design
Fluid antenna systems (FASs) have shown that activating a single port from a densely packed antenna array can yield spatial diversity comparable to that of tens of independent antennas, a property…Hotplug Coded Caching: Uncoded versus Row-Wise Coded Placements
In the hotplug coded caching model, $K$ users fill their caches of size $M$ as a function of $N$ files, but only an unknown subset of $A\leq K$ users is active in the delivery phase.Deep Reinforcement Learning for BD-RIS-Assisted Multi-UAV RSMA Communications
Beyond-diagonal reconfigurable intelligent surfaces (BD-RISs) extend conventional diagonal RISs by allowing controllable coupling among reflecting elements.Resilient Cell-Free MIMO ISAC Under Uncertainties: An Impairment-Aware Graph Neural Network Framework
Beamforming designs for integrated sensing and communication (ISAC) in cell-free multiple-input multiple-output (MIMO) systems face the challenge to stay reliable under uncertainties from both…Belief Propagation-Informed Tesseract Decoding of Quantum LDPC Codes
In quantum error correction, the decoder must estimate the errors from the measurement data accurately and fast enough to avoid a backlog.Reed-Muller Codes are Optimal Binary Linear 3-Query LCCs
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^{Ω(\sqrt{k})}$.The Covering Radius of the Reed--Muller Code \texorpdfstring{$\RM(3,8)$}{RM(3,8)} is 56
We prove that the covering radius of the third-order Reed--Muller code in eight variables is fifty-six.Harnessing Mutual Coupling in Cell-Free mMIMO
This letter investigates a cell-free massive MIMO system with $L$ access points (APs), each employing a small fixed-form-factor, uniform linear array of $N$ potentially closely spaced antennas.Good rational functions up to degree six
Locally recoverable codes (LRCs) are fundamental to the architecture of modern distributed storage systems.Non-Coherent Over-the-Air Distributed Consensus: Algorithm Design and Power Control Optimization
Non-coherent over-the-air (NCOTA) aggregation offers a scalable and communication-efficient approach to distributed average consensus in wireless networks, without requiring instantaneous channel…Finite-Memory Control of POMDPs: Fundamental Limits and Efficient Design
Optimal control of partially observable Markov decision processes (POMDPs), in general, requires a complete history.Beyond GNSS: Leveraging LEO Satellite Signals of Opportunity for Doppler Positioning
Large constellations of low Earth orbit (LEO) satellites provide ubiquitous global connectivity; yet, their rapid motion introduces significant Doppler shift effects.On the Failure Probability of Quantum Leftover Hashing with Bad Seeds
We study hashing against quantum adversaries, as used in cryptographic applications, and provide bounds on the probability of failure in practical settings where seeds might be reused and might be…An information-geometric formulation of distributed computation
Understanding how complex systems perform computations, i.e. how they store, transmit, and transform information across their components, is a major goal across the natural sciences.Quantum Private Information Retrieval on Forests
We consider the problem of graph private information retrieval (PIR) in the quantum setting.Uniform Sampling of Linear Codes with Prescribed Hull Dimension
We give exactly uniform samplers for linear codes with prescribed hull dimension, for the Euclidean, Hermitian, and symplectic inner products and over finite fields of every characteristic.Should We Combine Our Data? Algorithms and Limits for Privately Assessing Data Sharing
In this paper, we study when two parties should pool their data to train a machine learning model.Quantum channel tomography: optimal bounds in the near-boundary regime
Quantum channel tomography (also known as quantum process tomography) is a fundamental task in quantum information and quantum computing, aiming to learn the full description of an unknown quantum…