Timeline for Are there subsets L in R^n such that it is "easy to find" closest point in L to a given P in R^n ? Vague question motivated by error-correcting codes
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 25, 2012 at 6:24 | vote | accept | Alexander Chervov | ||
Jun 22, 2012 at 13:37 | answer | added | Pietro Majer | timeline score: 1 | |
Jun 22, 2012 at 11:33 | comment | added | Alexander Chervov | @Stanislav real life codes - means you should have a discrete subset in R^n, such that the distance between points is big, but diameter is small... But it is complicated, I rather vaguely asking about "nice mathematical constructions" which are might be "close" to this question, e.g. may be for some Grassmanianns naturally embedded in P^n will satisfy the property that we can project on it in "easy way" or something mathematically nice.. | |
Jun 22, 2012 at 11:06 | answer | added | user24527 | timeline score: 0 | |
Jun 22, 2012 at 11:03 | comment | added | Stanislav | Can you give examples of the subsets which are of interest in your application? | |
Jun 22, 2012 at 10:51 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
edited title
|
Jun 22, 2012 at 10:19 | history | asked | Alexander Chervov | CC BY-SA 3.0 |