Timeline for Sphere packing in $\{0,1\}^n$ with Hamming distance
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 10, 2017 at 22:46 | vote | accept | Dominic van der Zypen | ||
| Oct 10, 2017 at 21:14 | answer | added | kodlu | timeline score: 3 | |
| Oct 10, 2017 at 14:47 | comment | added | Dominic van der Zypen | @WlodekKuperberg right - and how to select $T$? I will google what Boris Bukh suggested on that behalf and see whether it gives me an answer | |
| Oct 10, 2017 at 14:37 | comment | added | Wlodek Kuperberg | I suppose you're asking for a reasonably efficient algorithm to determine this maximum cardinality, right? | |
| Oct 10, 2017 at 13:19 | comment | added | Boris Bukh | Keyword: coding theory | |
| Oct 10, 2017 at 13:10 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |