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 7
Concatenation Locality under Successive Adjacent Transpositions
We study codes correcting up to $t\geq1$ successive adjacent transpositions, using block concatenation to support blockwise encoding and decoding.A new class of optimal binary linear complementary pairs of codes
The construction of optimal binary linear complementary pair (LCP) has recently attracted considerable attention in coding theory.Equal Hamming Weights at Fixed Root Order and Applications to Constacyclic MDS Codes
For a fixed positive integer $n>1$, we study the prime powers $q$ coprime to $n$ for which all monic irreducible factors of $Φ_n$ over $\F_q$ have the same coefficient Hamming weight.Cyclotomic polynomials with trinomial irreducible factors over finite fields
We classify the pairs $(q,n)$, where $q$ is a prime power, $n>1$, and $\gcd(n,q)=1$, for which every irreducible factor of $Φ_n(x)$ over $\F_q$ has exactly three nonzero terms.Spatial Token Interleaving and Two-Pass BP Decoding for Semantic Image Transmission
Semantic error control coding (SECC) can correct the residual errors of a standard channel code with a foundation model that supplies a prior on the source content, but existing SECC schemes are…Leaving Quantum Bias on the Table: Pushforwards as a Path to Quantum Advantage in Constrained Optimization
Constrained quantum samplers often produce infeasible outputs that retain information about good feasible solutions.Service-Area Robust NOMA for Pinching Antennas Systems
Pinching-antenna systems (PASS) enable near-field beam focusing using radiating points along a dielectric waveguide, but coherent spherical-wave superposition makes their channels sensitive to small…Low-PAPR Rank-2 DFT-s-OFDM Waveform for 6G Uplink
Rank-2 discrete Fourier transform-spread orthogonal frequency-division multiplexing (DFT-s-OFDM) is attracting renewed interest for 6G uplink, offering not only spatial multiplexing gains but also…Noise Stability on the Hypercube: Order $7/8$
For a balanced Boolean function $f$ on the discrete hypercube, we study the $α$-stability $\mathbb{E}[(T_ρf)^α]$, where $T_ρ$ is the Boolean noise operator and $0<α<1$.The covering radius of the first-order Reed-Muller code in nine variables is 242
We prove that the covering radius of the binary first-order Reed-Muller code RM(1,9) is exactly 242.Closed-Form Gaussian Mixture Representations of d-Dimensional Triangulated Domains
We derive a Gaussian Mixture (GM) representation of a full-dimensional subset of Euclidean space with finite volume from a finite simplicial triangulation in closed form.A density theorem for non-standard irreducible cyclic codes
We prove a fixed-characteristic density form of the Berger-Charpin conjecture for non-degenerate irreducible cyclic codes: for each prime $p$, the lengths admitting such a non-standard code over…Latin cubes of order $4$ and $4320$-point quaternionic constructions in ${\mathbb R}^{16}$
Possibly the most enduring lower-bound record for kissing numbers in dimensions greater than $8$ (excluding $24$) is $$ κ_{16}\geq 4320. $$ This lower bound is attained by a shell of the famous…Shared Randomness and Parallel Rounds in Permutation Sampling
We study the shared randomness needed to sample a uniform permutation in parallel output rounds.Maximal input entropy for binary two-deletion and two-insertion channels
Under uniform transmission, we determine the received binary words that maximize input entropy for two-deletion and two-insertion channels.Digital Twin-Assisted Fast Beam Alignment for mmWave MIMO Networks
Millimeter-wave (mmWave) communication relies on directional beam sweeping for initial access, which incurs substantial latency and signaling overhead as antenna arrays grow large and deployments…Sub Terahertz LEO Satellite Communication: Is Doppler Shift a Major Challenge?
In this work, we investigate the impact of Doppler frequency shift on sub-terahertz low Earth orbit (LEO) satellite communications using OFDM transmission.Bilinear Hulls for Support Splitting: Characterization, Optimization, and Applications
Sendrier's Support Splitting Algorithm (SSA) is the standard solver for the Permutation Equivalence Problem (PEP); its cost is dominated by a term that grows exponentially in the hull dimension.On the Communication-Sensing Tradeoff in DMT-Optimal Space-time-Coded ISAC Systems
Integrated sensing and communications (ISAC) has been extensively studied from the perspective of communication-sensing performance tradeoffs.Researcher-in-the-Loop Evolutionary Discovery of Entanglement-Assisted Quantum Code Families
LLM-guided program evolution can produce mathematical constructions, but validity, generality, and reproducibility require distinct evidence.