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 3
Lossless Source Coding with Marginal Distribution Constraint
We consider lossless source coding with a marginal distribution constraint on the encoding symbols (SC-MDC).Goal Revelation as a Bridge Between Information-Theoretic Empowerment and Capability-Based Human Power
Power matters for AI safety.Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders
Quantum low-density parity-check (QLDPC) codes are promising for fault-tolerant quantum computing, but their decoding algorithms present significant hardware implementation challenges.Optimal Communication for Distributed Sparse Histogram Aggregation
Histogram estimation is a fundamental primitive in distributed data analysis, with applications in counting queries and federated learning.Pairwise Distortion Distribution with Graph-Based Importance Sampling for Quantization Error and Intrinsic Dimension Estimation
Quantifying the dimensionality of data is a fundamental need in machine learning and signal processing applications such as representation learning, data compression, and inverse problems, where the…A Conditional Quantum Kac-Bernstein Theorem
We establish a conditional quantum Kac-Bernstein theorem for mixing of two independent, finite-mode bosonic inputs with quantum memories.Binary Huffman Coding with Unequal Letter Costs Is NP-Complete
Binary prefix coding assigns prefix-free binary words to symbols to minimize their frequency-weighted cost.A Bayesian-Geometric Reading of Classical Model-Based Optimal Design
The classical model-based optimal design criteria (D-, T-, L-, C-, and A-optimality) are usually motivated via the Cramér--Rao bound as optimizing scalar functions of the Fisher information matrix…Estimating the generator of matrix exponential time-series
The achievable precision in estimating the spectrum of a time-series signal that is promised to be sparse in Fourier space deteriorates rapidly as the spectral peaks get closer together, as soon as…Mutual-Coupling-Aware Joint Precoding and Antenna Positioning for Movable-Antenna MU-MIMO Systems
Movable antennas (MAs) improve wireless communications by adapting antenna positions to the propagation environment.System-level performance in massive ISAC networks
We propose a dynamic stochastic geometry framework to model and evaluate large-scale integrated sensing and communication (ISAC) networks.Non-asymptotic Sphere-Packing Bounds for Finite-Blocklength Scalar Gaussian Multiple-Access and Broadcast Channels
This paper investigates non-asymptotic achievable rate regions of Gaussian multiple-access channels (MACs) and broadcast channels (BCs) in the finite-blocklength regime.Lower Bounds for Adaptive Relaxed Locally Decodable Codes via the Capped Horvitz--Thompson Estimator
We prove a nearly optimal lower bound on the blocklength of general relaxed locally decodable codes (RLDCs), extending the result of [GGS26] to nonlinear encodings and adaptive decoders with…Rate-Distortion-Perception Tradeoff for Vector Gaussian Sources with Limited Common Randomness: Exact Characterization and Approximate Universality
The distortion-rate-common randomness-perception (DRCP) theory characterizes how limited common randomness (CR) improves reconstruction fidelity under perceptual constraints, thereby providing an…Construction of New Complete Complementary Codes Using Extended Boolean Functions and Permutations
Complete complementary code (CCC) is a crucial component in the design and optimization of modern wireless communication systems, particularly in addressing challenges related to interference…Geometric Obstructions and Sharp Genus Dependence in LCD Scalings
We study the least pole order of a rational function whose nonzero evaluations scale a prescribed code to a Euclidean LCD code.Linear Equivalence of Full Weight Spectrum Cyclic Orbit Codes
We determine the linear-equivalence classes within the two families of full weight spectrum one-orbit cyclic subspace codes.The APN Property of Two Families of functions over $\F_{2^{n}}$ from the Switching Construction
Let $m\geq5$ be odd with $3\nmid m$.A Short Proof and Generalization of the Rainbow Cycle Theorem and Improved Bounds for Binary Even-Query LCCs
A \emph{rainbow cycle} in a list-edge-colored graph is a cycle where no color appears more than once.Rank-metric intersecting codes
Intersecting codes are codes in which any two nonzero codewords share a common nonzero coordinate, and they have been extensively studied due to their applications in communication theory…