Timeline for Binary codes with upper bound on pairwise distance
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11, 2013 at 14:41 | answer | added | Moshe Schwartz | timeline score: 4 | |
| Sep 8, 2013 at 15:06 | history | edited | Ricardo Andrade |
added top level tag (since question was bumped back to the top)
|
|
| Sep 8, 2013 at 14:16 | answer | added | Dima Pasechnik | timeline score: 2 | |
| Sep 8, 2013 at 11:54 | comment | added | Chris Godsil | One term used for these is "anticode". | |
| Sep 8, 2013 at 6:56 | comment | added | Robert Israel | @NoamD.Elkies: Slightly better, at least if $k$ is odd. For example, if $k=n-1$, you can get $|S| = 2^{n-1}$ with $S = \{x: x_1 = 0\}$. | |
| Sep 8, 2013 at 3:59 | comment | added | Noam D. Elkies | Can you do better than the set of all words of weight at most $k/2$? | |
| Sep 8, 2013 at 3:53 | comment | added | Yemon Choi | Aren't you just asking for the size of a set with a certain diameter? | |
| Sep 8, 2013 at 3:31 | review | Close votes | |||
| Sep 8, 2013 at 11:55 | |||||
| S Sep 8, 2013 at 3:23 | history | suggested | jeq | CC BY-SA 3.0 |
I made a mistake in my previous edit. Please roll it back, or use this correction.
|
| Sep 8, 2013 at 3:21 | review | Suggested edits | |||
| S Sep 8, 2013 at 3:23 | |||||
| S Sep 8, 2013 at 3:09 | history | suggested | jeq | CC BY-SA 3.0 |
Corrected what may have been a copy-and-paste error
|
| Sep 8, 2013 at 3:04 | review | Suggested edits | |||
| S Sep 8, 2013 at 3:09 | |||||
| Sep 8, 2013 at 2:53 | history | asked | Favst | CC BY-SA 3.0 |