Maximum-order Complexity and Correlation Measures
classification
🧮 math.NT
keywords
complexitycorrelationmaximum-ordermeasuressequencesmallbinarycannot
read the original abstract
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order $k$ cannot have very small maximum-order complexity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.