Fast Computation of the Arnold Complexity of Length $2^{n}$ Binary Words
Abstract
For fast computation of the Arnold complexity of length $2^{n}$ binary words we obtain an upper bound for the Shannon function $Sh(n)$
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2012
- DOI:
- 10.48550/arXiv.1209.4700
- arXiv:
- arXiv:1209.4700
- Bibcode:
- 2012arXiv1209.4700M
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Information Theory;
- 68R15
- E-Print:
- 7 pages