Cookies help us deliver our services. By using our services, you agree to our use of cookies.

Difference between revisions of "Low-Autocorrelation Binary Sequence Problem"


Line 1: Line 1:
 
<math>
 
<math>
S = \{s_{1},s_{2}, ..., s_{L} \};~~~s_{i} \in \{+1, -1\}
+
S = (s_{1},s_{2}, ..., s_{L});~~~s_{i} \in \{+1, -1\}
 
</math>
 
</math>
  

Revision as of 09:10, 26 November 2013


S = (s_{1},s_{2}, ..., s_{L});~~~s_{i} \in \{+1, -1\}


C_{k}(S) = \sum_{i=1}^{L-k}s_{i} \cdot s_{i+k}


E(S)=\sum_{k=1}^{L-1}{C_{k}^{2}(S)}


F(S) = \frac{L^{2}}{2 \cdot E(S)}