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 4
Do Ray-Traced Cities Make a Better Channel Prior for an Unseen Site? A Pre-Registered Study in Simulation, and a Test on Measured Channels that Reverses It
Channel estimators at a newly deployed base station usually start from 3GPP stochastic channel models, which describe no particular street.Regret-based Characterization, Information Limits, and the Sample Complexity of Auditing Adaptive Policies
A policy can earn its performance by where it locates on average or by reacting to information.Plotkin-optimal pure quantum LRCs with large minimum distances from NMDS codes
Quantum locally recoverable codes (qLRCs) are a class of quantum error-correcting codes that can recover an erased qudit by accessing only a few other qudits.On the most informative Boolean function under noise
Let $X$ be a uniform random bit string and $Y$ be obtained by flipping each bit of $X$ independently with probability $p$.Stabiliser codes over prime fields as weighted graphs and as quantum sets of lines
We further develop the theory of quantum stabiliser codes and its links with graph theory and finite geometry.A Unified Framework for Training-Dataset Aggregation and Exact Machine Unlearning via Gibbs Probability Measures
In this paper, three operations on Gibbs probability measures are studied: renormalization, normalized log-linear combination, and nesting.Exact signal recovery from generative priors with sigmoid output activation
We show exact signal recovery in generative compressed sensing for feedforward neural networks with piecewise-linear activations and a final sigmoid activation, with no assumption of expansivity.Achievability of CSS codes performance limits over Pauli channels under separate ML decoding with bounded graphical complexity
Capacity-approaching quantum error correction faces a fundamental tension: the required parity-check matrices need to become increasingly dense, while practical decoding and syndrome extraction…A Beam-Switched Sparse Circular Array for Passive Wi-Fi Sensing
Wi-Fi sensing applications require unambiguous angle-of-arrival (AoA) estimation over the full azimuth plane.Nearest Is Not Safest: Fluid-Antenna Port Selection for Over-the-Air Backpropagation in Urban Multipath
Over-the-air backpropagation returns a loss gradient through the reciprocal channel, which requires the return port to see the channel of the forward port.Which Chains to Calibrate for Physical Backpropagation: Per-User Factors Versus Base-Station Chains
In physical backpropagation, users return loss derivatives over the time-division duplex uplink, giving the base station the downlink gradient without channel reconstruction.A Sharp Mutual Information Bound for Binary Pairs
We prove a sharp upper bound on the mutual information between two binary random variables in terms of their distribution-dependent KL contraction coefficient.Inverse Design of Finite-State Channels by Dynamic Measure Matching
Inspired by the optimization approach to biology, we formulate an inverse problem for communication with memory: construct a finite-state channel for which a given signaling behavior supports…Finite attainment and efficient computation of regularized quantum channel relative entropy
Quantum channel relative entropy can be nonadditive, making its regularization essential for asymptotic analysis.Finding optimal measurement sequences for broken or constrained measuring devices
Measuring devices do not always function perfectly due to fatigue, damage, or malfunction.Explicit permutations of $(\mathbb{Z}/4\mathbb{Z})^m$ with uniformly bounded differential uniformity
Symmetric primitives over Galois rings need nonlinear components whose differentials with respect to ring addition are controlled.Information Complexity of Inner Product and Matrix Multiplication via Shannon-to-Min-Entropy Conversion
We determine the information complexity of matrix multiplication over finite fields under independent uniform inputs, up to a universal additive constant.Design and Analysis of Pinching-Antenna Systems With Radially Deployed Waveguides (X-PASS)
Pinching-antenna systems (PASS) reconfigure the wireless channel by positioning dielectric antennas along a waveguide.Movable Antenna-Assisted Secret Key Generation over Temporally Correlated Channels
Physical-layer key generation (PLKG) exploits reciprocal channel dynamics to generate symmetric keys, addressing the key distribution problem in wireless communications.Equivalent Graphical Conditions for Angle Rigidity and Angle-Based Network Localization
Angle rigidity theory provides a theoretical basis for characterizing the geometric shape of graphs embedded in the plane under angle constraints, and establishing global convergence of angle-based…