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
Graph Neural Networks for Resource Allocation in Integrated Sensing and Communication
In vehicular integrated sensing and communication (ISAC) networks, each service-provider vehicle uses a limited power budget to serve multiple sensing targets and communication receivers.Functional Converses for Private Matrix-Product Retrieval under Library-Wide Decoder-Side Correlation
We consider private retrieval of the matrix product $A^\top B^{(θ)}$ from replicated $P_c$-colluding servers when $B^{(\ell)}=A+N^{(\ell)}$, with the innovations mutually independent and independent…Energy-Time Optimal Decoding Using Expander-Graph LDPC Codes and Mesh Network Architecture
Within the Thompson VLSI model, the first energy optimal decoding schemes (up to polylogarithmic factors) that also reach clock cycle lower bounds are constructed.Design of a Speech Enhancement-Based Deep Semantic Autoencoder for Wireless Communications
Speech communication plays a crucial role in the Internet of Things and autonomous networks.Information-Spectrum General Formulas for the Capacity Region of Classical-Quantum Multiple Access Channels
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.Re-Planning Budgets under Admission Control in Grant-Free LEO Beam-Hopping Access
Reordering low-Earth-orbit (LEO) beam-hopping visits can reduce grant-free update delivery even when each region receives the same service time.Combinatorial limitations of list-decoding Reed-Solomon codes
For infinitely many rates $R \in (0,1)$, we show that full-length Reed-Solomon codes over fields of low characteristic can contain super-polynomially many codewords in a Hamming ball of radius just…Joint Flexible Beamforming, Resource Allocation, and Task Buffering for Movable-Antenna Enabled MEC Systems
The proliferation of computation-intensive applications, such as generative artificial intelligence and low-altitude economy services, demands mobile edge computing (MEC) systems that are both…A Universal Threshold Theory for Local Properties of Random Linear Codes
Thresholds for local properties tell us which guarantees to expect from random linear codes (RLCs) and help us carry those guarantees over to structured codes.Over-the-Scene Computation: Illumination-Programmed Functional Sensing of Unresolvable Populations
Decisions about dense populations depend on how much will cross a boundary by a deadline and when the first member arrives.Quantum Communication and Phase Sensing over a Dephasing Channel with Thermal Noise
Dephasing is a prominent source of decoherence in quantum communication, degrading phase coherence and transmission reliability.Operational Indirect Rate-Distortion Functions for Classification Tasks
In goal-oriented communications, indirect source coding involves two sources: a semantic source $X$ and an observation $Z$, which is the only source available at the encoder.Stealthy Malicious Interference Detection in UAV Formations: A Power-Domain Signaling Game Approach
Reliable intra-swarm communication is fundamental to cooperative sensing, control, and mission execution in unmanned aerial vehicle (UAV) swarms.Between Hi-Fi and MMI: the overlap of redundancy and synergy in partial information decomposition
Partial information decomposition (PID) splits the information that two sources carry about a target into redundant, unique and synergistic parts, with nonnegative decompositions lying on a segment…Drift-Resilient Predictive Interference Management: Online Adaptation of an Extreme-Value Predictor
Predictive interference management supports ultra-reliable low-latency communication (URLLC) by allocating finite-blocklength resources against a high conditional quantile of next-slot interference.AI-Native Task-Oriented Semantic Communications over a Relay: Benefits and Vulnerabilities
Semantic communication (SemCom) using a relay node is considered, where the relay assists in conveying task-relevant information from a source to a destination, with meaning defined by…Uniform Three-Fold Product Expansion of Algebraic-Geometry Codes over a Fixed Field
A collection of classical codes $C_1,\dots,C_m$ has product expansion if every low-weight word in the sum of their extensions to the product space can be written as a sum of words supported on few…NOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication Systems
This paper investigates a non-orthogonal multiple access assisted coordinated beam hopping (NOMA-CBH) scheme in multidimensional very low Earth orbit (VLEO) satellite communication systems, where…Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes
We determine the maximum number of common zeros in projective space of any set of linearly independent homogeneous polynomials of the same degree, when the degree is smaller than the cardinality of…The probabilistic bound for perfect hashing is sharp only for binary alphabets
We investigate the optimal asymptotic rate $R_q$ of perfect $q$-hash codes, a fundamental extremal problem in combinatorics, information theory, and computer science.