Timeline for Spreading $n$ points in $\{0,1\}^n$ as far as possible
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2019 at 7:53 | history | edited | YCor |
edited tags
|
|
| Dec 31, 2018 at 8:11 | vote | accept | Dominic van der Zypen | ||
| Dec 31, 2018 at 0:45 | answer | added | kodlu | timeline score: 11 | |
| Dec 31, 2018 at 0:42 | comment | added | Gerhard Paseman | No. By flipping all bits on a single coordinate, you can assume 0 in T. If there are two other vectors in T, the least Hamming distance between the three of them is at most 2n/3. I suspect the lim sup of your quantity is zero and not one, but I have not thought it through. Gerhard "The More Hamming, The Merrier" Paseman, 2018.12.30. | |
| Dec 31, 2018 at 0:11 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |