A Sharp Mutual Information Bound for Binary Pairs

Qianmian Guo

Home/Archive/arXiv

arXiv · 2611.02392

A Sharp Mutual Information Bound for Binary Pairs

Qianmian Guo

View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove a sharp upper bound on the mutual information between two binary random variables in terms of their distribution-dependent KL contraction coefficient. This resolves the binary-pair conjecture of Anantharam, Gohari, Kamath, and Nair. Equality holds if and only if the variables are independent or form a doubly symmetric binary source. The proof uses supporting tangents of an entropy curve to vary the input distribution and the channel while preserving the contraction coefficient. Together with tensorization and data processing, the result also bounds the mutual information between binary outputs obtained separately from two correlated observation sequences. When the observation pairs are independent copies of a finite-alphabet pair, this bound depends only on the law of one pair and not on the number of observations.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Qianmian Guo. 2026-11-02. A Sharp Mutual Information Bound for Binary Pairs. https://arxiv.org/abs/2611.02392

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A mathematical study of the excess growth rate

The excess growth rate, defined as the gap in Jensen's inequality for the logarithm, is a fundamental functional in portfolio theory. In this paper, we present a mathematical study motivated by information theory. We begin by establishing its properties and showing that it has rich connections with information-theoretic concepts such as the Helmholtz free energy, L. Campbell's measure of average code length and large deviations. Our main results consist of three axiomatic characterization theorems of the excess growth rate, in terms of (i) the relative entropy, (ii) the gap in Jensen's inequality, and (iii) the logarithmic divergence that generalizes the Bregman divergence. Furthermore, we study maximization of the excess growth rate and compare it with Kelly's growth optimal portfolio. Our results not only provide theoretical justifications of the significance of the excess growth rate, but also establish new connections between information theory and quantitative finance.

cs.IT↗

arXiv2026

A Unified Pulse-Shaped OFDM Framework for Chirp-Domain Waveforms: Continuous-Time Modeling and Practical I/O Analysis

A unified framework for chirp-domain waveforms, including orthogonal chirp division multiplexing (OCDM) and affine frequency division multiplexing (AFDM), is developed. Their continuous-time representations are shown to fall within the conventional Weyl-Heisenberg (WH) framework for multicarrier waveforms, with the root chirp as the prototype pulse. Since the root chirp has constant envelope and is transparent to subcarrier orthogonality, these waveforms can be further interpreted as pulse-shaped (PS) orthogonal frequency division multiplexing (OFDM) signals, whose power spectral density is derived analytically. The derived spectrum reveals that implementations based on the discrete affine Fourier transform rely on sub-Nyquist samples and exhibit frequency aliasing. We prove that the corresponding aliased chirps are only conditionally orthogonal, whereas sample-wise root-Nyquist pulse shaping of the discrete-time AFDM (DT-AFDM) sequence produces mutually orthogonal pulse-shaped chirps, resulting in the pulse-shaped AFDM (PS-AFDM) waveform. We then derive an exact waveform-level input-output (I/O) relation for PS-AFDM over delay-Doppler (DD) channels, showing that the effective channel at a practical receiver is generally not a superposition of pure path-wise DD components. Waveform simulations verify the derived relation to machine precision, while the conventional sequence-level I/O relation for DT-AFDM exhibits a substantial mismatch with waveform behavior for practical channels with continuous-valued delays.

cs.IT↗

arXiv2026

Domain-Adaptive Deep Joint Source-Channel Coding for Image Classification

Deep joint source--channel coding (Deep JSCC) can suffer from domain shift between training and deployment data. We study single-source domain adaptation for image classification over wireless channels. A Gaussian example shows that improving channel quality does not necessarily improve target-domain accuracy under a fixed source-trained classifier. We further proposed an information objective to reduce domain information while preserving class information. Motivated by the analysis, we develop a domain-adaptive Deep JSCC method that combines class-wise adversarial alignment with pseudo-label supervised contrastive learning. The former uses all target samples to reduce class-conditional domain differences, while the latter selects high-confidence target samples to obtain class-discriminative received representations. We relate these losses to the information objective, and analyze the effects of pseudo-label errors and confidence-based selection. Experiments on SVHN--MNIST and PACS over AWGN and Rayleigh channels demonstrate improved target-domain classification without additional inference-time networks. The proposed method achieves 98.15\% accuracy on SVHN $\rightarrow$ MNIST at 10~dB CSNR.

cs.IT↗