Maximum-Order Complexity and Correlation Measures
AbstractWe 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. View Full-Text
Scifeed alert for new publicationsNever 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
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.Chicago/Turabian Style
Işık, Leyla; Winterhof, Arne. 2017. "Maximum-Order Complexity and Correlation Measures." Cryptography 1, no. 1: 7.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.