Timeline for What exactly is the relationship between codes over finite fields and Euclidean sphere-packings?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2021 at 2:26 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
fixed arxiv front-end link and gave full published reference incl doi link
|
| Apr 2, 2011 at 13:41 | comment | added | Greg Kuperberg | @Henry If you find a way to extend the work of Eric Pine (who got a PhD from Granville in algorithmic number theory), it can be the Pine-Cohn theorem. | |
| Apr 2, 2011 at 13:13 | comment | added | Henry Cohn | Yes, at least the (10,40,4) one is. It is known to be an optimal code of block length 10 and minimal distance 4, so the name is doubly appropriate. Incidentally, the Singleton bound is also named after a person, but it's a little more confusing since one-element sets don't play an especially important role in the bound. All this really makes me wish my last name were spelled Cone instead of Cohn. Then I too could hope to have something confusingly named after me someday. | |
| Apr 2, 2011 at 13:01 | comment | added | Greg Kuperberg | @KConrad Some Google searches say that that is indeed what they are usually called. It's pun, because the codes are optimal for their parameters and because the mathematician was named Marc Best. (According to a posthumous paper, he died in 1987.) In a few cases, maybe to avoid confusion, they are called Best's codes. | |
| Apr 2, 2011 at 4:31 | comment | added | KConrad | Are Best's codes really called the Best codes? | |
| Dec 24, 2009 at 18:56 | history | answered | Greg Kuperberg | CC BY-SA 2.5 |