Timeline for When can this condition on linear codes be satisfied?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 20, 2019 at 10:54 | answer | added | Jyrki Lahtonen | timeline score: 2 | |
| Oct 20, 2019 at 10:01 | comment | added | Jyrki Lahtonen | Just to make sure you have heard of the coding theory terminology. If $V$ is a code, $r$ is called its covering radius - the balls of radius $r$ centered at the points of $V$ cover the whole space. The covering radius is a well-studied parameter. A lot is known about it for example for BCH-codes. Don't know if the range of parameters available from there fits your purposes that well. Coding theorists often want the covering radius to be small also. For efficiency. | |
| Sep 30, 2019 at 21:42 | comment | added | kodlu | since the answer states that linear vs nonlinear codes make no difference to your question, I was wondering what the direction of your generalization might be, if you don't mind sharing | |
| Sep 29, 2019 at 2:23 | history | became hot network question | |||
| Sep 28, 2019 at 21:07 | vote | accept | gowers | ||
| Sep 28, 2019 at 18:31 | answer | added | Ilya Bogdanov | timeline score: 12 | |
| Sep 28, 2019 at 18:09 | history | asked | gowers | CC BY-SA 4.0 |