Timeline for Repeats of all binary strings of length k
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2015 at 3:58 | vote | accept | Anahita | ||
| Oct 13, 2015 at 3:58 | |||||
| Sep 5, 2015 at 2:02 | comment | added | kodlu | @Anahita, you can choose $\lambda\geq 1$ and have everything appear at exactly $\lambda$ times. The other answer is more directly relevant to what you asked. On the other hand, I am unsure if any infinite families of covering arrays are known. | |
| Sep 4, 2015 at 18:16 | comment | added | Anahita | Thanks these are great refs. It seems though orthogonal array means every combination appears exactly once. Is there some thing more specific if we want at least once? | |
| Sep 1, 2015 at 22:21 | comment | added | kodlu | Sorry, fixed. You're right in OA notation his $n$ (length of sequence) is their $k.$ I wasn't aware of the existence restraint you stated. | |
| Sep 1, 2015 at 22:15 | history | edited | kodlu | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Sep 1, 2015 at 11:59 | comment | added | Janne Kokkala | Also, orthogonal arrays for $\lambda=1$, $v=2$ exist only when $k=t$, $k=t+1$ or $t=1$. | |
| Sep 1, 2015 at 3:19 | history | edited | kodlu | CC BY-SA 3.0 |
included extra parameter
|
| Sep 1, 2015 at 1:42 | history | answered | kodlu | CC BY-SA 3.0 |