Searcharxiv⌕ Search

arXiv · 2611.08131

Between Hi-Fi and MMI: the overlap of redundancy and synergy in partial information decomposition

Abstract

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 where redundancy measures are bounded by the positive part of the co-information and the smaller source-target information. We parameterize this segment by the overlap, the common excess of redundancy and synergy over their net balance, and show that for many of the named PID measures, their redundancy can be written as the largest positive part of the co-information over a set of reference distributions. This common form induces an ordering of those PIDs on the segment. With the smallest redundancy and synergy and the largest unique atoms of any nonnegative PID, the information-theoretic version of Hi-Fi, a feature-importance method, is the zero-overlap end of the segment for two sources, with the maximum overlap bound given by the minimum mutual information (MMI) PID. We introduce, by splitting the co-information into a pairwise maximum- entropy part and the third-order connected information, a PID that sits at zero overlap except when pairwise redundancy and triadic synergy coexist. For three or more sources the bivariate results hold on every pair of merged source groups, and among all nonnegative solutions of the lattice equations MMI and Hi-Fi still give the smallest and largest unique atoms but zero overlap on all pairs at once is often unattainable. Two inequalities across pairs are necessary in general and sufficient for three sources. For identity targets zero overlap is possible exactly when the sources' information diagram is nonnegative. In random three- and four-source distributions zero overlap on all pairs fails in 21-100% of the cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Niels Van Santen, Yves Rosseel, Daniele Marinazzo. 2026-11-05. Between Hi-Fi and MMI: the overlap of redundancy and synergy in partial information decomposition. https://arxiv.org/abs/2611.08131

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

KEEP EXPLORING

Related papers

Graphical Analysis of Lifted Product Code Constructions

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.

cs.IT↗

Sensing-Based Communication: A Non-Orthogonal Passive Reflection Framework for ISAC

While integrating uplink without disrupting the primary downlink remains a critical challenge for existing reflective communication systems, this paper proposes a non-orthogonal passive integrated sensing and communication (ISAC) mechanism termed Sensing-based Communication. Originating from and validated within an optical retro-reflective system, this mechanism possesses an underlying wave-agnostic architecture with the potential to be generalized across other physical modalities. It leverages incident downlink signals for parasitic modulation via passive tags. By relying solely on fundamental on-off keying (OOK) reflection, the tag unifies the reflective sensing channel and the uplink communication channel, and simultaneously achieves both sensing and duplex communication. Consequently, our approach introduces uplink capability without sacrificing the downlink data rate or consuming additional spectrum resources. At the receiver, we design a joint decoding architecture combining cross-correlation computation and successive interference cancelation (SIC) to fully exploit the degrees of freedom in broadband signals for multi-user interference suppression. We derive closed-form expressions for the interference and bit error rate (BER) assuming zero-mean Gaussian signals. Using an experimental testbed, we validate the pivotal theoretical finding, the scaling relationship of SINR with signal bandwidth and cross-correlation time--where linear regression yields a strong goodness-of-fit with $R^2 = 0.9688$. Furthermore, evaluations under noise-like orthogonal frequency division multiplexing (OFDM) waveforms exhibit high consistency between theoretical derivations and simulation data ($R^2 = 0.9372$, mean absolute percentage error, $\text{MAPE} = 14\%$), confirming the model's accuracy and waveform generalizability.

cs.IT↗

The Schur products of some nonbinary narrow-sense antiprimitive BCH codes

In recent years, the Schur products of linear codes have been extensively studied due to their favorable applications in cryptography. In this paper, we aim to study the parameters of the Schur products of some nonbinary narrow-sense antiprimitive BCH codes. Let $\mathcal{C}_1$ and $\mathcal{C}_2$ be two narrow-sense antiprimitive BCH codes with designed distances $δ_{1}$ and $δ_{2}$, respectively, where $2\le δ_{1},δ_{2}\le n$. Let $\mathcal{C}_1\star\mathcal{C}_2$ be the Schur product of $\mathcal{C}_1$ and $\mathcal{C}_2$. We present some necessary and sufficient conditions for $\mathcal{C}_1\star\mathcal{C}_2\ne\mathbb{F}_q^n$ by applying some constraints to $δ_{1}$ and $δ_{2}$. Furthermore, we determine the dimensions of these products and lower bounds on their minimum distance. Several linear codes with best known parameters are found.

cs.IT↗