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 2
Dynamics Aware Past-Future Information Bottleneck
The simplification of complex dynamical systems is essential for efficient estimation and control.Hotplug Coded Caching: Embedding the YMA and Interference Elimination Schemes via Reed--Muller Codes
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<K$ users is active in the delivery phase.Functional inequalities from the fundamental limits of Bayesian estimation
We develop a Bayesian information-theoretic framework for proving functional inequalities for log-concave measures.A Complete Characterization of $q$-Ary $2$-Designs in Doubly-Extended Reed-Solomon Codes
Let $\mathcal{C}_k$ be the doubly-extended Reed--Solomon code with parameters $[q+1, k, q-k+2]_q$.The Invocation Bottleneck in LLM-Based Lossless Compression: What Can Be Removed and What Must Be Traded
Large language models (LLMs) compress text far better than classical compressors, but LLM-based compressors are slow, particularly during decompression.Ray-Tracing-Based Dynamic Channel Sounding With Autoregressive Wi-Fi CSI Prediction
Channel sounding in Wi-Fi multiple-input multiple-output (MIMO) systems must balance channel state information (CSI) accuracy against CSI acquisition overhead.Exact Transport-Information Correspondence for Distribution-Adaptive Discretization
Discretization of continuous probability distributions is an operation on the sample space, and the structure induced by this operation cannot generally be determined solely from information geometry.Fano's Inequality and Channel Capacity in the Individual-Sequence Regime
We derive an individual-sequence analogue of Fano's inequality, replacing entropy by Lempel--Ziv (LZ) complexity and probability of error by empirical error frequency.Cross-Modal Semantic Successive Refinement for Generative Image Communication over Underwater Acoustic Channels
Underwater acoustic communication faces challenges such as limited available bandwidth and complex channel environments, which impose demanding requirements on efficient image transmission and…Separation Is a Riesz Energy: How Many Environments Does ICA Need?
Can independent components be recovered when all of them are Gaussian?The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
We determine the exact zero-error memory-rate tradeoff for secure coded caching with three users and any number $N\ge2$ of independent files.OSD-JSCC: Neural Joint Source-Channel Coding with One-Step Diffusion
Neural joint source-channel coding (JSCC) enables efficient image transmission over noisy channels, yet distortion-optimized approaches often produce blurry reconstructions.How many sorted projections determine n points in k dimensions?
Let $d_1,\dots,d_m$ be directions in $\mathbb{R}^k$, where $k\ge 2$.Energy-Accumulate-Then-Act Backscatter Communications With Retransmission Under Imperfect Feedback Detection
In this paper, we propose a threshold-triggered energy-accumulate-then-act backscatter communication system with retransmission under imperfect feedback detection.Distributed Consensus, Optimization, and Learning under Communication Constraints
Many modern engineering applications require distributed problem-solving in which multiple nodes in a network cooperate to achieve a common optimization objective.Linear-time erasure recovery for quantum expander codes
Erasures are used to model faults at a subset of known locations in various platforms used to construct fault-tolerant quantum computers.Logically Augmented Quantum LDPC Codes: Construction and Hierarchical Decoding
We propose a joint framework for constructing and decoding Logically Augmented (LA) quantum low-density parity-check (QLDPC) codes.Server-Side Sparse Assignment for Federated Mixture-of-Experts
Large language models (LLMs) are increasingly recognized for their remarkable capabilities; federated learning (FL) offers a promising framework for collaboratively fine-tuning LLMs on edge devices…Dithered Belief Propagation for Real-Time Quantum Memory Decoding
We introduce dithered belief-propagation decoding for circuit-level quantum memory to mitigate the oscillations and trapping behavior that limit standard belief-propagation (BP) decoders for qLDPC…Elapsed-Service-Time-Aware Preemption for Age of Information Minimization
We study the age of information and peak age of information in status update systems with an arbitrary number of independent sources sharing a single server with generally distributed service times.