Dimension-free exponential entropy quotients over F 2
cs.IT, math.CO, math.IT, math.PR
Submitted: 2026-10-28
Updated: 2026-10-28
Comments: 14 pages, no figures
License: http://creativecommons.org/licenses/by-sa/4.0/
The gist: Let X be a random vector in F 2 m, and let X' be an independent copy.
Abstract
Let X be a random vector in F 2 m, and let X' be an independent copy. We prove that, for every epsilon>0, there is a subspace G with G at most 2 320(1+ epsilon)/epsilonH(X) such that H(q GX) at most(1+ epsilon)(H(q GX+q GX')-H(q GX)). In particular, the quotient entropy is at most (1+ epsilon)(H(X+X')-H(X)). The coefficient is independent of the ambient dimension, and its exponential order in 1/epsilon is necessary. The structural result is a logarithmic rigidity estimate for finite weighted families of laws with averaged subspace entropy sparsity. A common variational quotient controls both a family and its convolution family without decreasing the original family's normalized mean entropy defect. Posterior families preserve averaged sparsity, and a fresh-index argument combines a local-to-global estimate with the entropic Marton theorem to increase the defect ratio at a fixed multiplicative sparsity cost. We also obtain two-input almost-additivity and concentration of moderate-doubling sets on subspace cosets at the same exponential scale. The constants are not optimized.
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound