Timeline for Does the Plotkin bound mean that one can not achieve the Singleton bound asymptotically?
Current License: CC BY-SA 4.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 22 at 4:08 | answer | added | Jonathan Mosheiff | timeline score: 2 | |
May 2, 2023 at 14:24 | comment | added | kodlu | Agree with the comments, tighten up your question with definitions if you want someone to pay more attention. | |
May 2, 2023 at 8:42 | comment | added | Peter Taylor | The Wikipedia page on the Singleton bound has examples of families of codes for which it is tight. I don't know whether that answers the question or means that the question needs to be worded more tightly. | |
May 2, 2023 at 7:24 | comment | added | Fedor Petrov | It is up to you, but usually questions with unclarified notations, definitions and references (even if they are standard in certain area) attract less attention. | |
May 2, 2023 at 1:25 | history | edited | bof | CC BY-SA 4.0 |
deleted 1 character in body; edited title
|
May 2, 2023 at 0:29 | history | edited | liu_c_6 | CC BY-SA 4.0 |
edited tags
|
May 2, 2023 at 0:17 | history | edited | liu_c_6 |
edited tags
|
|
May 2, 2023 at 0:07 | history | asked | liu_c_6 | CC BY-SA 4.0 |