Polar complexity is the minimum polar-compression length for exact sequence reconstruction, used in a lossless two-stage source code and an adaptive double-polar JSCC scheme that approaches entropy and trades off performance against complexity.
On the complexity of finite sequences
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A fractional dynamical networks ML framework detects cognitive fatigue transitions from EEG with 93.33% accuracy and 95% AUROC by capturing non-Markovian interdependencies via multifractal signatures.
citing papers explorer
-
Polar Complexity: A New Descriptive Complexity with Applications to Source and Joint Source-Channel Coding
Polar complexity is the minimum polar-compression length for exact sequence reconstruction, used in a lossless two-stage source code and an adaptive double-polar JSCC scheme that approaches entropy and trades off performance against complexity.