Timeline for How to find the minimum string length to produce a set of a given size with a minimum pairwise Hamming distance
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9, 2012 at 16:27 | comment | added | user25603 | If anyone is interested, here is an implementation of the recommended solution in R: gist.github.com/84bae05a5c3344710fb5 | |
| Aug 9, 2012 at 15:29 | vote | accept | user25603 | ||
| Aug 8, 2012 at 23:29 | answer | added | user9072 | timeline score: 2 | |
| Aug 8, 2012 at 23:04 | comment | added | user9072 | Could you please provide some context for this question. On the one hand, this is standard coding theory, but then on the other hand it seems you might be looking for something more specific. So, it is not clear. | |
| Aug 8, 2012 at 22:41 | answer | added | tergi | timeline score: 1 | |
| Aug 8, 2012 at 21:52 | comment | added | tergi | This is close enough to sphere packing to probably be an open research question. | |
| Aug 8, 2012 at 21:33 | history | asked | user25603 | CC BY-SA 3.0 |