Analytical representation of complexity diagrams

DOI10.1134/S003294602501003XMaRDI QIDQ6992165zbMATH OpenFDO

Authors V. G. Babikov, A. A. Galyaev

Publication date 28 April 2025

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S003294602501003X

zbMATH Keywords

discrete Fourier transformimbalanceinformation entropymetric gridsperiodogramspectral complexitystatistical complexity

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17)

Cites work

• A new spectral measure of complexity and its capabilities for detecting signals in noise
• Addition to: ``A new spectral measure of complexity and its capabilities for detecting signals in noise
• Information diagrams and their capabilities for classifying weak signals
• Order statistics of the normalized spectral distribution for detecting weak signals in white noise
• Ordinal pattern-based complexity analysis of high-dimensional chaotic time series
• Statistical complexity as a criterion for the useful signal detection problem

This page was built for publication: Analytical representation of complexity diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6992165)