Timeline for Bounded Hamming distance
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 8, 2013 at 4:41 | vote | accept | Favst | ||
| May 1, 2013 at 1:23 | answer | added | Yuichiro Fujiwara | timeline score: 7 | |
| Apr 30, 2013 at 8:35 | answer | added | Włodzimierz Holsztyński | timeline score: 2 | |
| Apr 30, 2013 at 4:36 | answer | added | Yuichiro Fujiwara | timeline score: 9 | |
| Apr 30, 2013 at 4:14 | comment | added | Favst | Sounds right. Other than your initial query about $x,y$ being distinct, I think there is no ambiguity in the statement. | |
| Apr 30, 2013 at 4:09 | comment | added | Włodzimierz Holsztyński | Thus for $b=n$ we get the standard question about the maximal codes of distance $a$ (which means at least $a$, such is terminology I think). Am I understanding your question properly? | |
| Apr 30, 2013 at 4:07 | comment | added | Włodzimierz Holsztyński | I think that you mean $x\ne y$, i.e. $\forall_{\{x\ y\}\in\binom S2}\ldots$ | |
| Apr 30, 2013 at 1:08 | history | asked | Favst | CC BY-SA 3.0 |