:: Library Catalog

Saved in:

Bibliographic Details
Main Author:	Standish, Russell K.
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2510.07722
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An improved upper bound measure of star complexity of graphs
by: Standish, Russell K.
Published: (2026)

Total/dual correlation/coherence, redundancy/synergy, complexity, and O-information for real and complex valued multivariate data
by: Pascual-Marqui, Roberto D., et al.
Published: (2025)

Generalized informational functionals and new monotone measures of statistical complexity
by: Iagar, Razvan Gabriel, et al.
Published: (2025)

Null models for comparing information decomposition across complex systems
by: Liardi, Alberto, et al.
Published: (2024)

The complexity of elliptic normal bases
by: Panario, Daniel, et al.
Published: (2024)

A scalable estimator of higher-order information in complex dynamical systems
by: Liardi, Alberto, et al.
Published: (2025)

The information-theoretic complexity of differentiable functions
by: Ruijgrok, Matthijs
Published: (2026)

Weighted cycle-based identification of influential node groups in complex networks
by: Zheng, Wenxin, et al.
Published: (2025)

Information entropy of complex probability
by: Li, Chan, et al.
Published: (2025)

The Fourier Ratio and complexity of signals
by: Aldaleh, K., et al.
Published: (2025)

The topology of synergy: linking topological and information-theoretic approaches to higher-order interactions in complex systems
by: Varley, Thomas F., et al.
Published: (2025)

Half-duplex communication complexity with adversary can be less than the classical communication complexity
by: Dektiarev, Mikhail, et al.
Published: (2024)

Low-complexity Voronoi shaping for the Gaussian channel
by: Li, S., et al.
Published: (2021)

On the Performance of Low-complexity Decoders of LDPC Codes
by: Peng, Qingqing, et al.
Published: (2024)

Causal Emergence 2.0: Quantifying emergent complexity
by: Hoel, Erik
Published: (2025)

An additively optimal interpreter for approximating Kolmogorov prefix complexity
by: Leyva-Acosta, Zoe, et al.
Published: (2024)

The unique, universal entropy for complex systems
by: Nelson, Kenric P.
Published: (2026)

Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
by: Abrahão, Felipe S., et al.
Published: (2024)

Generalized LDPC codes with low-complexity decoding and fast convergence
by: Simegn, Dawit, et al.
Published: (2025)

Optimal linear codes with few weights from simplicial complexes
by: Chen, Bing, et al.
Published: (2024)

Algorithmic complexity of $β$-expansions and application to A/D conversion
by: Abadie, Valentin, et al.
Published: (2024)

The structure and enumeration of periodic binary sequences with high nonlinear complexity
by: Yuan, Qin, et al.
Published: (2026)

Common information in well-mixing graphs and applications to information-theoretic cryptography
by: Caillat-Grenier, Geoffroy, et al.
Published: (2024)

Low-complexity eigenvector prediction-based precoding matrix prediction in massive MIMO with mobility
by: Qin, Ziao, et al.
Published: (2023)

Space-bounded online Kolmogorov complexity is additive
by: Bauwens, Bruno, et al.
Published: (2025)

The alpha-beta divergence for real and complex data
by: Cruces, Sergio
Published: (2025)

Stable recovery of complex dictionary-sparse signals from phaseless measurements
by: Xia, Lianxing, et al.
Published: (2025)

Low-complexity tuning of pinching-antenna systems for integrated sensing and communication
by: Asaad, Saba, et al.
Published: (2026)

An invitation to the sample complexity of quantum hypothesis testing
by: Cheng, Hao-Chung, et al.
Published: (2024)

On the sample complexity of parameter estimation in logistic regression with normal design
by: Hsu, Daniel, et al.
Published: (2023)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)

On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
by: Estevan, Asier, et al.
Published: (2024)

Infinite families of optimal and minimal codes over rings using simplicial complexes
by: Wu, Yanan, et al.
Published: (2024)

A note on the sample complexity of multi-target detection
by: Balanov, Amnon, et al.
Published: (2025)

Communication complexity of entanglement assisted multi-party computation
by: Meng, Ruoyu, et al.
Published: (2023)

On the reconstruction limits of complex networks
by: Murphy, Charles, et al.
Published: (2024)

On the $N$th $2$-adic complexity of binary sequences identified with algebraic $2$-adic integers
by: Chen, Zhixiong, et al.
Published: (2025)

Layered Belief Propagation for Low-complexity Large MIMO Detection Based on Statistical Beams
by: Takahashi, Takumi, et al.
Published: (2018)

Spectral approach to the communication complexity of multi-party key agreement
by: Caillat-Grenier, Geoffroy, et al.
Published: (2023)

Highly-sensitive measure of complexity captures boolean networks regimes and temporal order more optimally
by: Luevano, Manuel de J., et al.
Published: (2024)