Timeline for Lower bound for sum of binomial coefficients?
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 16, 2011 at 13:07 | comment | added | user13006 | Indeed, that's precisely the origin of the problem. I hadn't realized the connection between smaller epsilon and larger alphabets. Nice! That means the probabilities can be replaced by larger alphabets, so coding theory becomes relevant. (The lecture notes are also interesting to me for other reasons; there's been much progress in searching for more optimal codes in the last few years, so it's great to see Guruswami's notes from 2010. Thanks!) | |
| Feb 16, 2011 at 8:09 | history | answered | miforbes | CC BY-SA 2.5 |