Maximum-Order Complexity and Correlation Measures
Department of Mathematics, Salzburg University, Hellbrunner Str. 34, 5020 Salzburg, Austria
Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstr. 69, 4040 Linz, Austria
Author to whom correspondence should be addressed.
Academic Editor: Kwangjo Kim
Received: 29 March 2017 / Revised: 9 May 2017 / Accepted: 10 May 2017 / Published: 13 May 2017
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 is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Scifeed alert for new publications
Never miss any articles
matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
Define your Scifeed now
Share & Cite This Article
MDPI and ACS Style
Işık, L.; Winterhof, A. Maximum-Order Complexity and Correlation Measures. Cryptography 2017, 1, 7.
Işık L, Winterhof A. Maximum-Order Complexity and Correlation Measures. Cryptography. 2017; 1(1):7.
Işık, Leyla; Winterhof, Arne. 2017. "Maximum-Order Complexity and Correlation Measures." Cryptography 1, no. 1: 7.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
Multiple requests from the same IP address are counted as one view.