Low-Autocorrelation Binary Sequence Problem: Razlika med redakcijama
(Nova stran z vsebino: <math> S = (s_{1},s_{2}, ..., s_{L});~~~s_{i} \in \{+1, -1\} </math> <math> C_{k}(S) = \sum_{i=1}^{L-k}s_{i} \cdot s_{i+k} </math> <math> E(S)=\sum_{k=1}^{L-1}{C_{k}^{2}(S)} …) |
|||
Vrstica 14: | Vrstica 14: | ||
F(S) = \frac{L^{2}}{2 \cdot E(S)} | F(S) = \frac{L^{2}}{2 \cdot E(S)} | ||
</math> | </math> | ||
+ | |||
+ | <html> | ||
+ | <object border="1" type="text/html" data="https://labraj.uni-mb.si/xBed/xProj/B.labs" width="100%" height="500"></object> | ||
+ | </html> |
Redakcija: 09:51, 23. junij 2014
<html> <object border="1" type="text/html" data="https://labraj.uni-mb.si/xBed/xProj/B.labs" width="100%" height="500"></object> </html>